/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:35:22,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:35:22,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:35:22,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:35:22,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:35:22,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:35:22,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:35:22,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:35:22,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:35:22,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:35:22,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:35:22,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:35:22,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:35:22,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:35:22,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:35:22,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:35:22,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:35:22,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:35:22,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:35:22,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:35:22,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:35:22,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:35:22,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:35:22,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:35:22,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:35:22,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:35:22,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:35:22,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:35:22,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:35:22,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:35:22,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:35:22,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:35:22,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:35:22,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:35:22,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:35:22,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:35:22,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:35:22,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:35:22,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:35:22,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:35:22,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:35:22,701 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:35:22,716 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:35:22,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:35:22,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:35:22,717 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:35:22,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:35:22,718 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:35:22,718 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:35:22,718 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:35:22,718 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:35:22,718 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:35:22,718 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:35:22,719 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:35:22,719 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:35:22,719 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:35:22,719 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:35:22,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:35:22,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:35:22,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:35:22,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:35:22,720 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:35:22,720 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:35:22,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:35:22,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:35:22,721 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:35:22,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:35:22,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:35:22,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:35:22,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:35:22,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:35:22,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:35:22,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:35:22,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:35:22,904 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:35:22,905 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:35:22,905 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:35:28,262 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_SxItd0/tmp/312a7933b2104395bed9d87a78fa2e42/FLAG8e9654c16 !SESSION 2020-07-01 12:35:19.699 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_SxItd0/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-07-01 12:35:28.396 !MESSAGE Indexed 'FLAG8e9654c16' (0 sources, 0 headers) in 0.002 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-07-01 12:35:28,607 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:35:28,607 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:35:28,608 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:35:28,614 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_SxItd0/tmp/312a7933b2104395bed9d87a78fa2e42/FLAG8e9654c16 [2020-07-01 12:35:29,017 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_SxItd0/tmp/312a7933b2104395bed9d87a78fa2e42 [2020-07-01 12:35:29,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:35:29,029 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:35:29,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:35:29,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:35:29,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:35:29,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23adaeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29, skipping insertion in model container [2020-07-01 12:35:29,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:35:29,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:35:29,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:35:29,314 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:35:29,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:35:29,350 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:35:29,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29 WrapperNode [2020-07-01 12:35:29,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:35:29,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:35:29,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:35:29,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:35:29,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:35:29,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:35:29,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:35:29,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:35:29,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:35:29,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:35:29,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:35:29,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:35:29,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:35:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:35:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:35:29,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:35:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:35:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:35:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:35:29,758 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:35:29,758 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:35:29,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:35:29 BoogieIcfgContainer [2020-07-01 12:35:29,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:35:29,763 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:35:29,764 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:35:29,766 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:35:29,767 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:35:29" (1/1) ... [2020-07-01 12:35:29,787 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 38 edges [2020-07-01 12:35:29,788 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:35:29,789 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:35:29,789 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:35:29,790 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:35:29,792 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:35:29,793 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:35:29,793 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:35:29,816 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:35:29,841 INFO L200 BlockEncoder]: SBE split 13 edges [2020-07-01 12:35:29,846 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:35:29,847 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:35:29,878 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:35:29,880 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:35:29,882 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:35:29,882 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:35:29,882 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:35:29,883 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:35:29,883 INFO L313 BlockEncoder]: Encoded RCFG 25 locations, 41 edges [2020-07-01 12:35:29,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:35:29 BasicIcfg [2020-07-01 12:35:29,884 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:35:29,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:35:29,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:35:29,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:35:29,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:35:29" (1/4) ... [2020-07-01 12:35:29,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678e7e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:35:29, skipping insertion in model container [2020-07-01 12:35:29,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (2/4) ... [2020-07-01 12:35:29,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678e7e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:35:29, skipping insertion in model container [2020-07-01 12:35:29,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:35:29" (3/4) ... [2020-07-01 12:35:29,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678e7e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:35:29, skipping insertion in model container [2020-07-01 12:35:29,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:35:29" (4/4) ... [2020-07-01 12:35:29,893 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:35:29,903 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:35:29,911 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-07-01 12:35:29,925 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-07-01 12:35:29,947 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:35:29,948 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:35:29,948 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:35:29,948 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:35:29,948 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:35:29,948 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:35:29,948 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:35:29,948 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:35:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-01 12:35:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:35:29,969 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:29,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:35:29,970 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash 851781916, now seen corresponding path program 1 times [2020-07-01 12:35:29,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:29,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779746235] [2020-07-01 12:35:29,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:30,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779746235] [2020-07-01 12:35:30,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:30,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:35:30,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798683400] [2020-07-01 12:35:30,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:35:30,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:30,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:35:30,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:35:30,193 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2020-07-01 12:35:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:30,366 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2020-07-01 12:35:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:35:30,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:35:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:30,379 INFO L225 Difference]: With dead ends: 49 [2020-07-01 12:35:30,379 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:35:30,383 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:35:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:35:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:35:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:35:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2020-07-01 12:35:30,420 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 6 [2020-07-01 12:35:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:30,421 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. [2020-07-01 12:35:30,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:35:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2020-07-01 12:35:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:35:30,421 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:30,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:35:30,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:35:30,424 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash 871175857, now seen corresponding path program 1 times [2020-07-01 12:35:30,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:30,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837856369] [2020-07-01 12:35:30,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:30,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837856369] [2020-07-01 12:35:30,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:30,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:35:30,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727946780] [2020-07-01 12:35:30,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:35:30,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:35:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:35:30,489 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. [2020-07-01 12:35:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:30,640 INFO L93 Difference]: Finished difference Result 40 states and 63 transitions. [2020-07-01 12:35:30,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:35:30,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:35:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:30,643 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:35:30,643 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:35:30,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:35:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:35:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2020-07-01 12:35:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:35:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2020-07-01 12:35:30,650 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 6 [2020-07-01 12:35:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:30,651 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 39 transitions. [2020-07-01 12:35:30,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:35:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 39 transitions. [2020-07-01 12:35:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:35:30,652 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:30,652 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:35:30,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:35:30,652 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash 871175858, now seen corresponding path program 1 times [2020-07-01 12:35:30,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:30,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597296724] [2020-07-01 12:35:30,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:30,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597296724] [2020-07-01 12:35:30,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:30,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:35:30,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771296611] [2020-07-01 12:35:30,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:35:30,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:35:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:35:30,702 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. Second operand 4 states. [2020-07-01 12:35:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:30,878 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2020-07-01 12:35:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:35:30,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:35:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:30,879 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:35:30,879 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:35:30,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:35:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:35:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2020-07-01 12:35:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:35:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 66 transitions. [2020-07-01 12:35:30,900 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 66 transitions. Word has length 6 [2020-07-01 12:35:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:30,900 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 66 transitions. [2020-07-01 12:35:30,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:35:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 66 transitions. [2020-07-01 12:35:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:35:30,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:30,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:35:30,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:35:30,902 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:30,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash 871175855, now seen corresponding path program 1 times [2020-07-01 12:35:30,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:30,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360291755] [2020-07-01 12:35:30,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:30,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360291755] [2020-07-01 12:35:30,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:30,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:35:30,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441039586] [2020-07-01 12:35:30,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:35:30,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:30,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:35:30,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:35:30,937 INFO L87 Difference]: Start difference. First operand 34 states and 66 transitions. Second operand 3 states. [2020-07-01 12:35:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:31,014 INFO L93 Difference]: Finished difference Result 34 states and 66 transitions. [2020-07-01 12:35:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:35:31,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:35:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:31,017 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:35:31,017 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:35:31,018 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:35:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:35:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:35:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:35:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 44 transitions. [2020-07-01 12:35:31,024 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 44 transitions. Word has length 6 [2020-07-01 12:35:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:31,024 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 44 transitions. [2020-07-01 12:35:31,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:35:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2020-07-01 12:35:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:35:31,025 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:31,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:35:31,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:35:31,026 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash 871176070, now seen corresponding path program 1 times [2020-07-01 12:35:31,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:31,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002996329] [2020-07-01 12:35:31,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:31,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002996329] [2020-07-01 12:35:31,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:31,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:35:31,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696207786] [2020-07-01 12:35:31,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:35:31,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:35:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:35:31,085 INFO L87 Difference]: Start difference. First operand 28 states and 44 transitions. Second operand 5 states. [2020-07-01 12:35:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:31,214 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2020-07-01 12:35:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:35:31,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-07-01 12:35:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:31,216 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:35:31,216 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:35:31,216 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:35:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:35:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-07-01 12:35:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:35:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-07-01 12:35:31,222 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 6 [2020-07-01 12:35:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:31,222 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-07-01 12:35:31,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:35:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-01 12:35:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:35:31,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:31,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:35:31,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:35:31,223 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1236646404, now seen corresponding path program 1 times [2020-07-01 12:35:31,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:31,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414405089] [2020-07-01 12:35:31,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:31,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414405089] [2020-07-01 12:35:31,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:31,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:35:31,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216696828] [2020-07-01 12:35:31,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:35:31,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:31,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:35:31,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:35:31,269 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 4 states. [2020-07-01 12:35:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:31,393 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2020-07-01 12:35:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:35:31,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:35:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:31,394 INFO L225 Difference]: With dead ends: 48 [2020-07-01 12:35:31,394 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 12:35:31,395 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:35:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 12:35:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2020-07-01 12:35:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:35:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2020-07-01 12:35:31,401 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 7 [2020-07-01 12:35:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:31,402 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2020-07-01 12:35:31,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:35:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2020-07-01 12:35:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:35:31,402 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:31,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:35:31,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:35:31,403 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:31,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:31,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1236646405, now seen corresponding path program 1 times [2020-07-01 12:35:31,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:31,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824388621] [2020-07-01 12:35:31,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:31,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824388621] [2020-07-01 12:35:31,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:31,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:35:31,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929098699] [2020-07-01 12:35:31,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:35:31,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:31,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:35:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:35:31,451 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 5 states. [2020-07-01 12:35:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:31,613 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2020-07-01 12:35:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:35:31,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-01 12:35:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:31,614 INFO L225 Difference]: With dead ends: 54 [2020-07-01 12:35:31,614 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 12:35:31,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:35:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 12:35:31,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2020-07-01 12:35:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:35:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2020-07-01 12:35:31,621 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 7 [2020-07-01 12:35:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:31,622 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2020-07-01 12:35:31,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:35:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2020-07-01 12:35:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:35:31,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:31,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:35:31,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:35:31,623 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:31,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:31,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1236655305, now seen corresponding path program 1 times [2020-07-01 12:35:31,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:31,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862726720] [2020-07-01 12:35:31,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:31,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862726720] [2020-07-01 12:35:31,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:31,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:35:31,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155914548] [2020-07-01 12:35:31,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:35:31,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:31,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:35:31,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:35:31,649 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 3 states. [2020-07-01 12:35:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:31,685 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2020-07-01 12:35:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:35:31,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:35:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:31,686 INFO L225 Difference]: With dead ends: 59 [2020-07-01 12:35:31,686 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:35:31,687 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:35:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:35:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 12:35:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 12:35:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2020-07-01 12:35:31,692 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 7 [2020-07-01 12:35:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:31,693 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2020-07-01 12:35:31,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:35:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2020-07-01 12:35:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:35:31,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:31,694 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:35:31,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:35:31,694 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:31,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1903912626, now seen corresponding path program 1 times [2020-07-01 12:35:31,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:31,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690429359] [2020-07-01 12:35:31,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:31,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690429359] [2020-07-01 12:35:31,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252549070] [2020-07-01 12:35:31,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:35:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:31,795 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 12:35:31,800 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:35:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:31,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:35:31,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-07-01 12:35:31,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594009120] [2020-07-01 12:35:31,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:35:31,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:35:31,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:35:31,861 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 8 states. [2020-07-01 12:35:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:32,078 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2020-07-01 12:35:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:35:32,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-01 12:35:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:32,079 INFO L225 Difference]: With dead ends: 63 [2020-07-01 12:35:32,080 INFO L226 Difference]: Without dead ends: 57 [2020-07-01 12:35:32,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:35:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-01 12:35:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2020-07-01 12:35:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:35:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2020-07-01 12:35:32,093 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 12 [2020-07-01 12:35:32,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:32,093 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2020-07-01 12:35:32,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:35:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2020-07-01 12:35:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:35:32,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:32,094 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:35:32,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-01 12:35:32,295 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:32,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1903912625, now seen corresponding path program 1 times [2020-07-01 12:35:32,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:32,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082219619] [2020-07-01 12:35:32,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:32,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082219619] [2020-07-01 12:35:32,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651670710] [2020-07-01 12:35:32,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:35:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:32,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:35:32,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:35:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:32,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:35:32,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2020-07-01 12:35:32,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779469146] [2020-07-01 12:35:32,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:35:32,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:32,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:35:32,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:35:32,448 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand 5 states. [2020-07-01 12:35:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:32,525 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-07-01 12:35:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:35:32,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-01 12:35:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:32,526 INFO L225 Difference]: With dead ends: 70 [2020-07-01 12:35:32,526 INFO L226 Difference]: Without dead ends: 67 [2020-07-01 12:35:32,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:35:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-01 12:35:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2020-07-01 12:35:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 12:35:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2020-07-01 12:35:32,534 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 12 [2020-07-01 12:35:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:32,535 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2020-07-01 12:35:32,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:35:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2020-07-01 12:35:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:35:32,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:32,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:35:32,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 12:35:32,736 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1903903725, now seen corresponding path program 1 times [2020-07-01 12:35:32,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:32,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362425290] [2020-07-01 12:35:32,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:32,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362425290] [2020-07-01 12:35:32,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:32,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:35:32,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582330395] [2020-07-01 12:35:32,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:35:32,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:32,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:35:32,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:35:32,772 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand 4 states. [2020-07-01 12:35:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:32,832 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-01 12:35:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:35:32,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 12:35:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:32,833 INFO L225 Difference]: With dead ends: 56 [2020-07-01 12:35:32,833 INFO L226 Difference]: Without dead ends: 54 [2020-07-01 12:35:32,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:35:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-01 12:35:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2020-07-01 12:35:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:35:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2020-07-01 12:35:32,840 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 12 [2020-07-01 12:35:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:32,841 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-07-01 12:35:32,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:35:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2020-07-01 12:35:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:35:32,841 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:32,842 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:35:32,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:35:32,842 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:32,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:32,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1712327894, now seen corresponding path program 1 times [2020-07-01 12:35:32,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:32,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842718454] [2020-07-01 12:35:32,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:32,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842718454] [2020-07-01 12:35:32,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503091160] [2020-07-01 12:35:32,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:35:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:32,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:35:32,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:35:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:33,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:35:33,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2020-07-01 12:35:33,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615220344] [2020-07-01 12:35:33,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 12:35:33,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:33,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 12:35:33,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:35:33,008 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 12 states. [2020-07-01 12:35:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:33,267 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2020-07-01 12:35:33,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:35:33,269 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-07-01 12:35:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:33,270 INFO L225 Difference]: With dead ends: 108 [2020-07-01 12:35:33,270 INFO L226 Difference]: Without dead ends: 76 [2020-07-01 12:35:33,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:35:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-01 12:35:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2020-07-01 12:35:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-01 12:35:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2020-07-01 12:35:33,279 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 18 [2020-07-01 12:35:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:33,279 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2020-07-01 12:35:33,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 12:35:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2020-07-01 12:35:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-01 12:35:33,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:33,280 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:35:33,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-01 12:35:33,481 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:33,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1361575454, now seen corresponding path program 2 times [2020-07-01 12:35:33,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:33,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881994606] [2020-07-01 12:35:33,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 12:35:33,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881994606] [2020-07-01 12:35:33,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874676301] [2020-07-01 12:35:33,544 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:35:33,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:35:33,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:35:33,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 12:35:33,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:35:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 12:35:33,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:35:33,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-07-01 12:35:33,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996124659] [2020-07-01 12:35:33,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:35:33,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:33,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:35:33,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:35:33,631 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand 8 states. [2020-07-01 12:35:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:33,741 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2020-07-01 12:35:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:35:33,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-01 12:35:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:33,742 INFO L225 Difference]: With dead ends: 61 [2020-07-01 12:35:33,742 INFO L226 Difference]: Without dead ends: 57 [2020-07-01 12:35:33,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:35:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-01 12:35:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2020-07-01 12:35:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 12:35:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2020-07-01 12:35:33,748 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 23 [2020-07-01 12:35:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:33,748 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2020-07-01 12:35:33,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:35:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2020-07-01 12:35:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-01 12:35:33,749 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:35:33,750 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:35:33,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:35:33,950 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:35:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1703778448, now seen corresponding path program 1 times [2020-07-01 12:35:33,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:33,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14299565] [2020-07-01 12:35:33,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:35:34,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14299565] [2020-07-01 12:35:34,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094821406] [2020-07-01 12:35:34,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:35:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:34,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:35:34,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:35:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:35:34,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:35:34,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2020-07-01 12:35:34,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870408332] [2020-07-01 12:35:34,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 12:35:34,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:34,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 12:35:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:35:34,157 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 11 states. [2020-07-01 12:35:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:34,325 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2020-07-01 12:35:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:35:34,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-07-01 12:35:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:35:34,326 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:35:34,327 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:35:34,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:35:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:35:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:35:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:35:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:35:34,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-07-01 12:35:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:35:34,328 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:35:34,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 12:35:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:35:34,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:35:34,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-01 12:35:34,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:35:34,821 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-07-01 12:35:35,206 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2020-07-01 12:35:35,210 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:35:35,210 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 12:35:35,211 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:35:35,211 INFO L268 CegarLoopResult]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-07-01 12:35:35,211 INFO L268 CegarLoopResult]: For program point L26-2(lines 26 28) no Hoare annotation was computed. [2020-07-01 12:35:35,211 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:35:35,211 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:35:35,211 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:35:35,211 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:35:35,211 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:35:35,211 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:35:35,212 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:35:35,212 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:35:35,212 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2020-07-01 12:35:35,212 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:35:35,212 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:35:35,212 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 16) no Hoare annotation was computed. [2020-07-01 12:35:35,213 INFO L264 CegarLoopResult]: At program point L12-3(lines 12 16) the Hoare annotation is: (let ((.cse9 (select |#length| ULTIMATE.start_SelectionSort_~a.base))) (let ((.cse8 (* 4 ULTIMATE.start_SelectionSort_~i~0)) (.cse14 (= 0 ULTIMATE.start_SelectionSort_~min~0)) (.cse0 (= 0 ULTIMATE.start_SelectionSort_~a.offset)) (.cse1 (<= 1 ULTIMATE.start_SelectionSort_~min~0)) (.cse2 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_SelectionSort_~a.base))) (.cse13 (= 0 ULTIMATE.start_SelectionSort_~i~0)) (.cse16 (<= (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 ULTIMATE.start_SelectionSort_~min~0) 4) .cse9)) (.cse6 (<= (+ ULTIMATE.start_SelectionSort_~min~0 1) ULTIMATE.start_SelectionSort_~j~0)) (.cse17 (+ ULTIMATE.start_SelectionSort_~i~0 2))) (let ((.cse4 (<= ULTIMATE.start_SelectionSort_~j~0 .cse17)) (.cse10 (<= (+ ULTIMATE.start_SelectionSort_~j~0 1) ULTIMATE.start_SelectionSort_~array_size)) (.cse12 (or (and .cse0 .cse2 .cse3 (<= (+ ULTIMATE.start_SelectionSort_~a.offset 8) .cse9) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse16 .cse6))) (.cse15 (<= (+ .cse8 12) .cse9)) (.cse5 (<= .cse17 ULTIMATE.start_SelectionSort_~j~0)) (.cse11 (<= 0 ULTIMATE.start_SelectionSort_~i~0)) (.cse7 (<= (* 4 ULTIMATE.start_SelectionSort_~array_size) .cse9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ .cse8 8) .cse9)) (and .cse0 .cse10 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~j~0) .cse6 .cse11 .cse7) (and .cse4 .cse12 .cse5 .cse7) (and .cse0 .cse10 .cse2 .cse3 .cse13 .cse6 .cse14 .cse7) (and .cse15 .cse12 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse16 .cse5 .cse6 .cse11 .cse7))))) [2020-07-01 12:35:35,213 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:35:35,213 INFO L268 CegarLoopResult]: For program point L12-4(lines 12 16) no Hoare annotation was computed. [2020-07-01 12:35:35,213 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:35:35,213 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:35:35,214 INFO L264 CegarLoopResult]: At program point L8-2(lines 8 21) the Hoare annotation is: (let ((.cse9 (select |#length| ULTIMATE.start_SelectionSort_~a.base))) (let ((.cse3 (<= 1 ULTIMATE.start_SelectionSort_~j~0)) (.cse4 (<= (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 ULTIMATE.start_SelectionSort_~min~0) 4) .cse9)) (.cse6 (<= (+ ULTIMATE.start_SelectionSort_~min~0 1) ULTIMATE.start_SelectionSort_~j~0)) (.cse7 (<= 0 ULTIMATE.start_SelectionSort_~i~0)) (.cse5 (+ ULTIMATE.start_SelectionSort_~i~0 1)) (.cse0 (= 0 ULTIMATE.start_SelectionSort_~a.offset)) (.cse1 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_SelectionSort_~a.base))) (.cse10 (= 0 ULTIMATE.start_SelectionSort_~i~0)) (.cse8 (<= (* 4 ULTIMATE.start_SelectionSort_~array_size) .cse9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 ULTIMATE.start_SelectionSort_~j~0) .cse6 .cse7 .cse8 (<= (+ (* 4 ULTIMATE.start_SelectionSort_~i~0) 8) .cse9)) (and (<= ULTIMATE.start_main_~array_size~0 1) .cse10 (<= ULTIMATE.start_SelectionSort_~array_size 1)) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_SelectionSort_~array_size .cse5) .cse4 .cse6 .cse7 .cse8 (<= ULTIMATE.start_SelectionSort_~j~0 .cse5)) (and .cse0 .cse1 .cse2 .cse10 .cse8 (<= (+ ULTIMATE.start_SelectionSort_~array_size 3) .cse9))))) [2020-07-01 12:35:35,214 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:35:35,214 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:35:35,217 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:35:35,228 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,229 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,230 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,230 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,230 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,230 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,239 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,247 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,247 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,247 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,247 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,247 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,248 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,248 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,248 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,248 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,249 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,249 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,253 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,253 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,253 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:35:35 BasicIcfg [2020-07-01 12:35:35,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:35:35,259 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:35:35,259 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:35:35,263 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:35:35,264 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:35:35,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:35:29" (1/5) ... [2020-07-01 12:35:35,265 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@137f3dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:35:35, skipping insertion in model container [2020-07-01 12:35:35,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:35:35,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:35:29" (2/5) ... [2020-07-01 12:35:35,266 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@137f3dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:35:35, skipping insertion in model container [2020-07-01 12:35:35,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:35:35,266 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:35:29" (3/5) ... [2020-07-01 12:35:35,266 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@137f3dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:35:35, skipping insertion in model container [2020-07-01 12:35:35,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:35:35,266 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:35:29" (4/5) ... [2020-07-01 12:35:35,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@137f3dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:35:35, skipping insertion in model container [2020-07-01 12:35:35,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:35:35,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:35:35" (5/5) ... [2020-07-01 12:35:35,268 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:35:35,294 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:35:35,294 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:35:35,294 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:35:35,294 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:35:35,294 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:35:35,294 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:35:35,295 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:35:35,295 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:35:35,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-01 12:35:35,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:35:35,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:35:35,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:35:35,307 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:35:35,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:35:35,308 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:35:35,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-01 12:35:35,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:35:35,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:35:35,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:35:35,310 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:35:35,310 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:35:35,316 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue [146] ULTIMATE.startENTRY-->L26: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 18#L26true [103] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 27#L26-2true [121] L26-2-->L8-2: Formula: (and (= |v_ULTIMATE.start_SelectionSort_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_SelectionSort_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_SelectionSort_~a.base_1 |v_ULTIMATE.start_SelectionSort_#in~a.base_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_SelectionSort_~array_size_1 |v_ULTIMATE.start_SelectionSort_#in~array_size_1|) (= |v_ULTIMATE.start_SelectionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* v_ULTIMATE.start_main_~array_size~0_7 4))) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_SelectionSort_~a.offset_1 |v_ULTIMATE.start_SelectionSort_#in~a.offset_1|) (= v_ULTIMATE.start_SelectionSort_~i~0_1 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_1, ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_1|, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_1|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_1, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_1, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_1|, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_1|, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_1|, ULTIMATE.start_SelectionSort_#in~array_size=|v_ULTIMATE.start_SelectionSort_#in~array_size_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_1, ULTIMATE.start_SelectionSort_#in~a.offset=|v_ULTIMATE.start_SelectionSort_#in~a.offset_1|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_SelectionSort_#in~a.base=|v_ULTIMATE.start_SelectionSort_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_#in~a.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~a.base, ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_#t~mem5, ULTIMATE.start_SelectionSort_#t~mem4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_SelectionSort_#t~mem2, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_SelectionSort_#in~array_size, #length, ULTIMATE.start_SelectionSort_#in~a.base] 20#L8-2true [2020-07-01 12:35:35,316 INFO L796 eck$LassoCheckResult]: Loop: 20#L8-2true [86] L8-2-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~i~0_5 1))) (and (= v_ULTIMATE.start_SelectionSort_~j~0_2 .cse0) (= v_ULTIMATE.start_SelectionSort_~min~0_2 v_ULTIMATE.start_SelectionSort_~i~0_5) (< .cse0 v_ULTIMATE.start_SelectionSort_~array_size_4))) InVars {ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_2, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_2, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_2} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_~min~0] 25#L12-3true [106] L12-3-->L12-4: Formula: (>= v_ULTIMATE.start_SelectionSort_~j~0_4 v_ULTIMATE.start_SelectionSort_~array_size_5) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} AuxVars[] AssignedVars[] 23#L12-4true [149] L12-4-->L19: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_14))) (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_SelectionSort_~a.base_21)) (= v_ULTIMATE.start_SelectionSort_~temp~0_5 (select (select |v_#memory_int_9| v_ULTIMATE.start_SelectionSort_~a.base_21) (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 (* v_ULTIMATE.start_SelectionSort_~i~0_14 4)))) (<= (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse0 4) (select |v_#length_15| v_ULTIMATE.start_SelectionSort_~a.base_21)) (<= 0 (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse0)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_5, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~mem4] 24#L19true [94] L19-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_7))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_SelectionSort_~a.base_12)) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_SelectionSort_~a.base_12) (+ (* v_ULTIMATE.start_SelectionSort_~min~0_7 4) v_ULTIMATE.start_SelectionSort_~a.offset_9)) |v_ULTIMATE.start_SelectionSort_#t~mem5_2|) (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_SelectionSort_~a.base_12)) (<= 0 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_2|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5] 22#L19-1true [151] L19-1-->L20: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_16))) (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_SelectionSort_~a.base_22)) (<= 0 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16)) (= |v_#memory_int_10| (store |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22 (store (select |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22) (+ (* v_ULTIMATE.start_SelectionSort_~i~0_16 4) v_ULTIMATE.start_SelectionSort_~a.offset_16) |v_ULTIMATE.start_SelectionSort_#t~mem5_6|))) (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16 4) (select |v_#length_16| v_ULTIMATE.start_SelectionSort_~a.base_22)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_6|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5, #memory_int] 8#L20true [152] L20-->L8-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_11))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_SelectionSort_~a.base_23)) (= (store |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23 (store (select |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23) (+ (* v_ULTIMATE.start_SelectionSort_~min~0_11 4) v_ULTIMATE.start_SelectionSort_~a.offset_17) v_ULTIMATE.start_SelectionSort_~temp~0_6)) |v_#memory_int_12|) (<= 0 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17)) (= v_ULTIMATE.start_SelectionSort_~i~0_17 (+ v_ULTIMATE.start_SelectionSort_~i~0_18 1)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_SelectionSort_~a.base_23)))) InVars {ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_18, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_4|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_17, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~i~0, #memory_int] 20#L8-2true [2020-07-01 12:35:35,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:35,317 INFO L82 PathProgramCache]: Analyzing trace with hash 173411, now seen corresponding path program 1 times [2020-07-01 12:35:35,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:35,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530349345] [2020-07-01 12:35:35,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:35,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530349345] [2020-07-01 12:35:35,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:35,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 12:35:35,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879532069] [2020-07-01 12:35:35,332 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:35:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:35:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -842929377, now seen corresponding path program 1 times [2020-07-01 12:35:35,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:35:35,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719320406] [2020-07-01 12:35:35,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:35:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:35:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:35:35,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719320406] [2020-07-01 12:35:35,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:35:35,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:35:35,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471099567] [2020-07-01 12:35:35,344 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:35:35,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:35:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:35:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:35:35,355 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-01 12:35:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:35:35,397 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. [2020-07-01 12:35:35,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:35:35,400 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:35:35,404 INFO L168 Benchmark]: Toolchain (without parser) took 6374.68 ms. Allocated memory was 514.9 MB in the beginning and 645.4 MB in the end (delta: 130.5 MB). Free memory was 438.1 MB in the beginning and 607.2 MB in the end (delta: -169.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:35:35,404 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:35:35,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.82 ms. Allocated memory was 514.9 MB in the beginning and 557.3 MB in the end (delta: 42.5 MB). Free memory was 438.1 MB in the beginning and 523.8 MB in the end (delta: -85.7 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:35:35,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.87 ms. Allocated memory is still 557.3 MB. Free memory was 523.8 MB in the beginning and 521.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:35:35,405 INFO L168 Benchmark]: Boogie Preprocessor took 27.86 ms. Allocated memory is still 557.3 MB. Free memory was 521.8 MB in the beginning and 520.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:35:35,406 INFO L168 Benchmark]: RCFGBuilder took 341.14 ms. Allocated memory is still 557.3 MB. Free memory was 520.4 MB in the beginning and 498.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:35:35,406 INFO L168 Benchmark]: BlockEncodingV2 took 120.56 ms. Allocated memory is still 557.3 MB. Free memory was 498.9 MB in the beginning and 490.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:35:35,407 INFO L168 Benchmark]: TraceAbstraction took 5373.17 ms. Allocated memory was 557.3 MB in the beginning and 643.3 MB in the end (delta: 86.0 MB). Free memory was 489.4 MB in the beginning and 400.7 MB in the end (delta: 88.7 MB). Peak memory consumption was 174.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:35:35,407 INFO L168 Benchmark]: BuchiAutomizer took 142.83 ms. Allocated memory was 643.3 MB in the beginning and 645.4 MB in the end (delta: 2.1 MB). Free memory was 400.7 MB in the beginning and 607.2 MB in the end (delta: -206.5 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:35:35,411 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 33 locations, 38 edges - StatisticsResult: Encoded RCFG 25 locations, 41 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 320.82 ms. Allocated memory was 514.9 MB in the beginning and 557.3 MB in the end (delta: 42.5 MB). Free memory was 438.1 MB in the beginning and 523.8 MB in the end (delta: -85.7 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.87 ms. Allocated memory is still 557.3 MB. Free memory was 523.8 MB in the beginning and 521.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.86 ms. Allocated memory is still 557.3 MB. Free memory was 521.8 MB in the beginning and 520.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 341.14 ms. Allocated memory is still 557.3 MB. Free memory was 520.4 MB in the beginning and 498.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 120.56 ms. Allocated memory is still 557.3 MB. Free memory was 498.9 MB in the beginning and 490.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 5373.17 ms. Allocated memory was 557.3 MB in the beginning and 643.3 MB in the end (delta: 86.0 MB). Free memory was 489.4 MB in the beginning and 400.7 MB in the end (delta: 88.7 MB). Peak memory consumption was 174.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 142.83 ms. Allocated memory was 643.3 MB in the beginning and 645.4 MB in the end (delta: 2.1 MB). Free memory was 400.7 MB in the beginning and 607.2 MB in the end (delta: -206.5 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-07-01 12:35:35,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((0 == a && 1 <= array_size) && 1 == \valid[a]) && 1 <= j) && a + 4 * min + 4 <= unknown-#length-unknown[a]) && i + 1 <= j) && min + 1 <= j) && 0 <= i) && 4 * array_size <= unknown-#length-unknown[a]) && 4 * i + 8 <= unknown-#length-unknown[a]) || ((array_size <= 1 && 0 == i) && array_size <= 1)) || (((((((((0 == a && 1 <= array_size) && 1 == \valid[a]) && 1 <= j) && array_size <= i + 1) && a + 4 * min + 4 <= unknown-#length-unknown[a]) && min + 1 <= j) && 0 <= i) && 4 * array_size <= unknown-#length-unknown[a]) && j <= i + 1)) || (((((0 == a && 1 <= array_size) && 1 == \valid[a]) && 0 == i) && 4 * array_size <= unknown-#length-unknown[a]) && array_size + 3 <= unknown-#length-unknown[a]) - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 12:35:35,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:35:35,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((0 == a && 1 <= min) && 1 <= array_size) && 1 == \valid[a]) && j <= i + 2) && i + 2 <= j) && min + 1 <= j) && 4 * array_size <= unknown-#length-unknown[a]) && 4 * i + 8 <= unknown-#length-unknown[a]) || ((((((((0 == a && j + 1 <= array_size) && 1 <= min) && 1 <= array_size) && 1 == \valid[a]) && i + 1 <= j) && min + 1 <= j) && 0 <= i) && 4 * array_size <= unknown-#length-unknown[a])) || (((j <= i + 2 && ((((((0 == a && 1 <= array_size) && 1 == \valid[a]) && a + 8 <= unknown-#length-unknown[a]) && 0 == i) && 0 == min) || ((((((0 == a && 1 <= min) && 1 <= array_size) && 1 == \valid[a]) && 0 == i) && a + 4 * min + 4 <= unknown-#length-unknown[a]) && min + 1 <= j))) && i + 2 <= j) && 4 * array_size <= unknown-#length-unknown[a])) || (((((((0 == a && j + 1 <= array_size) && 1 <= array_size) && 1 == \valid[a]) && 0 == i) && min + 1 <= j) && 0 == min) && 4 * array_size <= unknown-#length-unknown[a])) || (((4 * i + 12 <= unknown-#length-unknown[a] && ((((((0 == a && 1 <= array_size) && 1 == \valid[a]) && a + 8 <= unknown-#length-unknown[a]) && 0 == i) && 0 == min) || ((((((0 == a && 1 <= min) && 1 <= array_size) && 1 == \valid[a]) && 0 == i) && a + 4 * min + 4 <= unknown-#length-unknown[a]) && min + 1 <= j))) && i + 2 <= j) && 4 * array_size <= unknown-#length-unknown[a])) || (((((((((0 == a && 1 <= min) && 1 <= array_size) && 1 == \valid[a]) && 4 * i + 12 <= unknown-#length-unknown[a]) && a + 4 * min + 4 <= unknown-#length-unknown[a]) && i + 2 <= j) && min + 1 <= j) && 0 <= i) && 4 * array_size <= unknown-#length-unknown[a]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.5s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 675 SDslu, 272 SDs, 0 SdLazy, 1140 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 129 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 13 NumberOfFragments, 478 HoareAnnotationTreeSize, 2 FomulaSimplifications, 8118 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 1594 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 30965 SizeOfPredicates, 14 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 30/103 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:35:35.657 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check