./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0c73140129db08253eb2666e014a272764010e16 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:35:35,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:35:35,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:35:35,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:35:35,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:35:35,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:35:35,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:35:35,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:35:35,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:35:35,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:35:35,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:35:35,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:35:35,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:35:35,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:35:35,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:35:35,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:35:35,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:35:35,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:35:35,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:35:35,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:35:35,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:35:35,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:35:35,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:35:35,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:35:35,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:35:35,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:35:35,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:35:35,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:35:35,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:35:35,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:35:35,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:35:35,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:35:35,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:35:35,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:35:35,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:35:35,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:35:35,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:35:35,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:35:35,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:35:35,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:35:35,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:35:35,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:35:35,986 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:35:35,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:35:35,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:35:35,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:35:35,988 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:35:35,988 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:35:35,988 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:35:35,988 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:35:35,988 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:35:35,989 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:35:35,989 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:35:35,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:35:35,989 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:35:35,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:35:35,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:35:35,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:35:35,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:35:35,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:35:35,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:35:35,991 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:35:35,991 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:35:35,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:35:35,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:35:35,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:35:35,992 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:35:35,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:35:35,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:35:35,993 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:35:35,993 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:35:35,994 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:35:35,994 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c73140129db08253eb2666e014a272764010e16 [2020-07-29 01:35:36,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:35:36,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:35:36,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:35:36,290 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:35:36,290 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:35:36,291 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2020-07-29 01:35:36,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d7aa7ae/19b22ab5c73b48029f4d40c3afe5a5ff/FLAG9e4e444bd [2020-07-29 01:35:36,845 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:35:36,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2020-07-29 01:35:36,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d7aa7ae/19b22ab5c73b48029f4d40c3afe5a5ff/FLAG9e4e444bd [2020-07-29 01:35:37,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d7aa7ae/19b22ab5c73b48029f4d40c3afe5a5ff [2020-07-29 01:35:37,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:35:37,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:35:37,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:37,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:35:37,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:35:37,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337b2e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37, skipping insertion in model container [2020-07-29 01:35:37,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:35:37,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:35:37,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:37,560 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:35:37,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:37,713 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:35:37,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37 WrapperNode [2020-07-29 01:35:37,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:37,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:37,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:35:37,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:35:37,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:37,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:35:37,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:35:37,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:35:37,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:35:37,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:35:37,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:35:37,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:35:37,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:35:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:35:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:35:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:35:37,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:35:37,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:35:38,281 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:35:38,282 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:35:38,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:38 BoogieIcfgContainer [2020-07-29 01:35:38,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:35:38,286 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:35:38,286 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:35:38,290 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:35:38,291 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:38,291 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:35:37" (1/3) ... [2020-07-29 01:35:38,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69d5587d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:38, skipping insertion in model container [2020-07-29 01:35:38,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:38,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (2/3) ... [2020-07-29 01:35:38,293 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69d5587d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:38, skipping insertion in model container [2020-07-29 01:35:38,293 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:38,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:38" (3/3) ... [2020-07-29 01:35:38,295 INFO L371 chiAutomizerObserver]: Analyzing ICFG diff-alloca-1.i [2020-07-29 01:35:38,340 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:35:38,340 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:35:38,340 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:35:38,340 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:35:38,341 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:35:38,341 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:35:38,341 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:35:38,341 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:35:38,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:35:38,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:38,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:38,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:38,391 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:38,392 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:38,392 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:35:38,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:35:38,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:38,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:38,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:38,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:38,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:38,404 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 9#L574true assume !(main_~Alen~0 < 1); 14#L574-2true assume !(main_~Blen~0 < 1); 7#L577-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 12#L554-2true [2020-07-29 01:35:38,405 INFO L796 eck$LassoCheckResult]: Loop: 12#L554-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L558-2true assume !true; 6#L557-2true assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 11#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 12#L554-2true [2020-07-29 01:35:38,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,412 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:35:38,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611380825] [2020-07-29 01:35:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,574 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2020-07-29 01:35:38,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362884528] [2020-07-29 01:35:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:38,633 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#true} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {20#true} is VALID [2020-07-29 01:35:38,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {20#true} assume !true; {21#false} is VALID [2020-07-29 01:35:38,634 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#false} assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; {21#false} is VALID [2020-07-29 01:35:38,635 INFO L280 TraceCheckUtils]: 3: Hoare triple {21#false} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {21#false} is VALID [2020-07-29 01:35:38,638 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-29 01:35:38,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362884528] [2020-07-29 01:35:38,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:38,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:35:38,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127822975] [2020-07-29 01:35:38,654 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:38,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:38,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:35:38,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:35:38,671 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-07-29 01:35:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:38,722 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:35:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:35:38,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:35:38,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:38,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-07-29 01:35:38,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:38,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2020-07-29 01:35:38,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:35:38,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:35:38,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2020-07-29 01:35:38,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:38,757 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-29 01:35:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2020-07-29 01:35:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:35:38,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:38,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 15 transitions. Second operand 10 states. [2020-07-29 01:35:38,788 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 15 transitions. Second operand 10 states. [2020-07-29 01:35:38,790 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 10 states. [2020-07-29 01:35:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:38,796 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2020-07-29 01:35:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2020-07-29 01:35:38,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:38,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:38,798 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 15 transitions. [2020-07-29 01:35:38,799 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 15 transitions. [2020-07-29 01:35:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:38,804 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2020-07-29 01:35:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2020-07-29 01:35:38,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:38,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:38,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:38,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:35:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-07-29 01:35:38,814 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-29 01:35:38,814 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-29 01:35:38,814 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:35:38,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2020-07-29 01:35:38,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:38,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:38,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:38,816 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:38,816 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:38,816 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 37#L574 assume !(main_~Alen~0 < 1); 38#L574-2 assume !(main_~Blen~0 < 1); 44#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 42#L554-2 [2020-07-29 01:35:38,816 INFO L796 eck$LassoCheckResult]: Loop: 42#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 40#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 45#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 41#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 42#L554-2 [2020-07-29 01:35:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-07-29 01:35:38,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750872820] [2020-07-29 01:35:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2020-07-29 01:35:38,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220444316] [2020-07-29 01:35:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,885 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2020-07-29 01:35:38,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608559928] [2020-07-29 01:35:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:39,019 INFO L280 TraceCheckUtils]: 0: Hoare triple {73#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {73#true} is VALID [2020-07-29 01:35:39,020 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#true} havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; {73#true} is VALID [2020-07-29 01:35:39,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {73#true} assume !(main_~Alen~0 < 1); {73#true} is VALID [2020-07-29 01:35:39,021 INFO L280 TraceCheckUtils]: 3: Hoare triple {73#true} assume !(main_~Blen~0 < 1); {75#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 01:35:39,023 INFO L280 TraceCheckUtils]: 4: Hoare triple {75#(<= 1 ULTIMATE.start_main_~Blen~0)} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; {76#(<= 1 ULTIMATE.start_diff_~l2~0)} is VALID [2020-07-29 01:35:39,024 INFO L280 TraceCheckUtils]: 5: Hoare triple {76#(<= 1 ULTIMATE.start_diff_~l2~0)} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {77#(and (<= 1 ULTIMATE.start_diff_~l2~0) (= 0 ULTIMATE.start_diff_~j~0) (= 0 ULTIMATE.start_diff_~found~0))} is VALID [2020-07-29 01:35:39,026 INFO L280 TraceCheckUtils]: 6: Hoare triple {77#(and (<= 1 ULTIMATE.start_diff_~l2~0) (= 0 ULTIMATE.start_diff_~j~0) (= 0 ULTIMATE.start_diff_~found~0))} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {74#false} is VALID [2020-07-29 01:35:39,026 INFO L280 TraceCheckUtils]: 7: Hoare triple {74#false} assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; {74#false} is VALID [2020-07-29 01:35:39,026 INFO L280 TraceCheckUtils]: 8: Hoare triple {74#false} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {74#false} is VALID [2020-07-29 01:35:39,027 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-29 01:35:39,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608559928] [2020-07-29 01:35:39,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:39,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:35:39,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261004226] [2020-07-29 01:35:39,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:39,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:35:39,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:35:39,218 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-07-29 01:35:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:39,341 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-07-29 01:35:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:35:39,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:35:39,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:39,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2020-07-29 01:35:39,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:35:39,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2020-07-29 01:35:39,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:35:39,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:35:39,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2020-07-29 01:35:39,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:39,365 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-07-29 01:35:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2020-07-29 01:35:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-29 01:35:39,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:39,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 18 transitions. Second operand 11 states. [2020-07-29 01:35:39,368 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 18 transitions. Second operand 11 states. [2020-07-29 01:35:39,368 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand 11 states. [2020-07-29 01:35:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:39,370 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-07-29 01:35:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2020-07-29 01:35:39,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:39,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:39,371 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states and 18 transitions. [2020-07-29 01:35:39,371 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states and 18 transitions. [2020-07-29 01:35:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:39,373 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-07-29 01:35:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2020-07-29 01:35:39,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:39,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:39,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:39,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:35:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-29 01:35:39,376 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:35:39,376 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:35:39,377 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:35:39,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:35:39,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:35:39,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:39,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:39,379 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:39,379 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:35:39,379 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 94#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 95#L574 assume !(main_~Alen~0 < 1); 96#L574-2 assume !(main_~Blen~0 < 1); 103#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 100#L554-2 [2020-07-29 01:35:39,379 INFO L796 eck$LassoCheckResult]: Loop: 100#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 102#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 97#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 98#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 104#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 99#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 100#L554-2 [2020-07-29 01:35:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:39,380 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2020-07-29 01:35:39,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:39,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714496369] [2020-07-29 01:35:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2020-07-29 01:35:39,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:39,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309839010] [2020-07-29 01:35:39,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:39,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {134#true} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {134#true} is VALID [2020-07-29 01:35:39,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {134#true} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {134#true} is VALID [2020-07-29 01:35:39,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {134#true} assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; {136#(= 1 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 01:35:39,455 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#(= 1 ULTIMATE.start_diff_~found~0)} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {136#(= 1 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 01:35:39,457 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#(= 1 ULTIMATE.start_diff_~found~0)} assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; {135#false} is VALID [2020-07-29 01:35:39,457 INFO L280 TraceCheckUtils]: 5: Hoare triple {135#false} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {135#false} is VALID [2020-07-29 01:35:39,458 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-29 01:35:39,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309839010] [2020-07-29 01:35:39,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:39,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:35:39,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799217809] [2020-07-29 01:35:39,459 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:39,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:39,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:35:39,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:35:39,460 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:35:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:39,518 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:35:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:35:39,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:39,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:39,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2020-07-29 01:35:39,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:35:39,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 01:35:39,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:35:39,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:35:39,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-07-29 01:35:39,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:39,537 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:35:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-07-29 01:35:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-07-29 01:35:39,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:39,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand 13 states. [2020-07-29 01:35:39,540 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand 13 states. [2020-07-29 01:35:39,540 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 13 states. [2020-07-29 01:35:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:39,542 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:35:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:35:39,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:39,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:39,543 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 15 states and 20 transitions. [2020-07-29 01:35:39,543 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 15 states and 20 transitions. [2020-07-29 01:35:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:39,545 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:35:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:35:39,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:39,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:39,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:39,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:35:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-07-29 01:35:39,548 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:35:39,548 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:35:39,548 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:35:39,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:35:39,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:35:39,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:39,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:39,550 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:39,550 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:35:39,551 INFO L794 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 152#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 153#L574 assume !(main_~Alen~0 < 1); 154#L574-2 assume !(main_~Blen~0 < 1); 162#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 160#L554-2 [2020-07-29 01:35:39,551 INFO L796 eck$LassoCheckResult]: Loop: 160#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 161#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 155#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 156#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 163#L557-2 assume !(0 == diff_~found~0); 159#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 160#L554-2 [2020-07-29 01:35:39,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:39,552 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2020-07-29 01:35:39,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:39,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820918324] [2020-07-29 01:35:39,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,582 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2020-07-29 01:35:39,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:39,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322184478] [2020-07-29 01:35:39,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:39,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:39,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2020-07-29 01:35:39,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:39,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882972538] [2020-07-29 01:35:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,711 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:40,358 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2020-07-29 01:35:40,621 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-07-29 01:35:40,634 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:40,635 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:40,635 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:40,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:40,636 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:40,636 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:40,636 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:40,636 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:40,636 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration4_Lasso [2020-07-29 01:35:40,636 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:40,637 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:40,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:41,201 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-07-29 01:35:41,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:41,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:41,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:41,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:41,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:41,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:41,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:42,309 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:42,317 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:43,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:43,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:43,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:43,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:43,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:43,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:43,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:43,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:43,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:43,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:43,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:43,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:43,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:43,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:43,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:43,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:43,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:43,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:43,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:43,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:43,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:43,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:43,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:43,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:43,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:43,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:43,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:43,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:43,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:43,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:43,143 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:43,189 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:35:43,189 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 23 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:43,209 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:43,248 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:35:43,249 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:43,250 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, v_rep(select #length ULTIMATE.start_diff_~A.base)_1) = -4*ULTIMATE.start_diff_~i~0 + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 Supporting invariants [1*ULTIMATE.start_diff_~A.offset >= 0] [2020-07-29 01:35:43,385 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2020-07-29 01:35:43,391 INFO L393 LassoCheck]: Loop: "assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0;" "assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4);" "assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1;" "assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);" "assume !(0 == diff_~found~0);" "diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7;" [2020-07-29 01:35:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:35:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:35:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:43,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {204#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {204#unseeded} is VALID [2020-07-29 01:35:43,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {204#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; {204#unseeded} is VALID [2020-07-29 01:35:43,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {204#unseeded} assume !(main_~Alen~0 < 1); {204#unseeded} is VALID [2020-07-29 01:35:43,489 INFO L280 TraceCheckUtils]: 3: Hoare triple {204#unseeded} assume !(main_~Blen~0 < 1); {204#unseeded} is VALID [2020-07-29 01:35:43,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {204#unseeded} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; {298#(and (>= ULTIMATE.start_diff_~A.offset 0) unseeded)} is VALID [2020-07-29 01:35:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:35:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:43,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {299#(and (>= ULTIMATE.start_diff_~A.offset 0) (>= oldRank0 (+ (* (- 4) ULTIMATE.start_diff_~i~0) (select |#length| ULTIMATE.start_diff_~A.base))))} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {299#(and (>= ULTIMATE.start_diff_~A.offset 0) (>= oldRank0 (+ (* (- 4) ULTIMATE.start_diff_~i~0) (select |#length| ULTIMATE.start_diff_~A.base))))} is VALID [2020-07-29 01:35:43,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {299#(and (>= ULTIMATE.start_diff_~A.offset 0) (>= oldRank0 (+ (* (- 4) ULTIMATE.start_diff_~i~0) (select |#length| ULTIMATE.start_diff_~A.base))))} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {322#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} is VALID [2020-07-29 01:35:43,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {322#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; {322#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} is VALID [2020-07-29 01:35:43,554 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {322#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} is VALID [2020-07-29 01:35:43,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} assume !(0 == diff_~found~0); {322#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} is VALID [2020-07-29 01:35:43,557 INFO L280 TraceCheckUtils]: 5: Hoare triple {322#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {301#(and (or (and (> oldRank0 (+ (* (- 4) ULTIMATE.start_diff_~i~0) (select |#length| ULTIMATE.start_diff_~A.base))) (>= oldRank0 0)) unseeded) (>= ULTIMATE.start_diff_~A.offset 0))} is VALID [2020-07-29 01:35:43,557 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-29 01:35:43,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:43,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:43,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:35:43,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,581 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:35:43,582 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:35:43,693 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2020-07-29 01:35:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:43,693 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:43,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. cyclomatic complexity: 6 [2020-07-29 01:35:43,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:43,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:43,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:43,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:43,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:43,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:43,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-07-29 01:35:43,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:43,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:43,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:43,701 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 6 [2020-07-29 01:35:43,703 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:35:43,704 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:43,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:43,705 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:43,705 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:43,706 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:43,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:35:43,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:35:43,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:35:43,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:43,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:43,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:43,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:43,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:43,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:43,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:35:43,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:35:43,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:35:43,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:35:43,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:35:43,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:35:43,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:43,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:43,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:43,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:35:43,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:35:43,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:35:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:35:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:35:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:35:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:35:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:35:43,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:35:43,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:43,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:43,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:43,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:35:43,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:35:43,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:35:43,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:43,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:43,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:43,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:35:43,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:35:43,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:35:43,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:43,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:43,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:43,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:43,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:43,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:43,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:43,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:43,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:43,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,730 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:35:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:35:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:35:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:35:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:43,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:43,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2020-07-29 01:35:43,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:35:43,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:35:43,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2020-07-29 01:35:43,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:43,737 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 01:35:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2020-07-29 01:35:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 01:35:43,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:43,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 24 transitions. Second operand 16 states. [2020-07-29 01:35:43,739 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 24 transitions. Second operand 16 states. [2020-07-29 01:35:43,739 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 16 states. [2020-07-29 01:35:43,739 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:43,742 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-29 01:35:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-07-29 01:35:43,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:43,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:43,743 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 24 transitions. [2020-07-29 01:35:43,743 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 24 transitions. [2020-07-29 01:35:43,744 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:43,746 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-29 01:35:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-07-29 01:35:43,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:43,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:43,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:43,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:35:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2020-07-29 01:35:43,748 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-29 01:35:43,748 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-29 01:35:43,748 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:35:43,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2020-07-29 01:35:43,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:43,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:43,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:43,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:35:43,750 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:43,750 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 366#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 367#L574 assume !(main_~Alen~0 < 1); 373#L574-2 assume !(main_~Blen~0 < 1); 379#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 377#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 369#L558-2 [2020-07-29 01:35:43,751 INFO L796 eck$LassoCheckResult]: Loop: 369#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 368#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 369#L558-2 [2020-07-29 01:35:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:43,751 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2020-07-29 01:35:43,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:43,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973770240] [2020-07-29 01:35:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,762 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,774 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2020-07-29 01:35:43,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:43,775 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728225467] [2020-07-29 01:35:43,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,781 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:43,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:43,787 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2020-07-29 01:35:43,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:43,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675629619] [2020-07-29 01:35:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:44,372 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 111 [2020-07-29 01:35:44,631 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-07-29 01:35:44,634 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:44,634 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:44,634 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:44,634 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:44,635 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:44,635 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:44,635 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:44,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:44,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration5_Lasso [2020-07-29 01:35:44,635 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:44,636 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:44,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:45,201 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2020-07-29 01:35:45,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:45,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:45,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:45,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:45,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:45,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:45,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:45,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:45,775 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-07-29 01:35:46,210 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-07-29 01:35:46,471 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:46,471 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:46,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:46,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:46,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:46,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:46,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:46,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:46,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:46,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:46,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:46,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:46,806 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:46,880 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2020-07-29 01:35:46,880 INFO L444 ModelExtractionUtils]: 18 out of 73 variables were initially zero. Simplification set additionally 50 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:46,885 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,888 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:35:46,888 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:46,888 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2, ULTIMATE.start_diff_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 - 2*ULTIMATE.start_diff_~j~0 Supporting invariants [-2*ULTIMATE.start_diff_~l2~0 + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_2 >= 0] [2020-07-29 01:35:46,982 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2020-07-29 01:35:46,989 INFO L393 LassoCheck]: Loop: "assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4);" "assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4;" [2020-07-29 01:35:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:46,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:35:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:35:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:47,239 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_80|], 2=[|v_#valid_110|]} [2020-07-29 01:35:47,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:35:47,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:35:47,276 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:47,277 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 38 [2020-07-29 01:35:47,278 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:47,325 INFO L624 ElimStorePlain]: treesize reduction 12, result has 79.7 percent of original size [2020-07-29 01:35:47,336 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:35:47,340 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:47,367 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:47,461 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:47,470 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:35:47,471 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:65 [2020-07-29 01:35:47,479 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:47,480 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_80|, |ULTIMATE.start_main_#t~malloc10.base|, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_~Blen~0, |ULTIMATE.start_main_#t~malloc12.base|, |v_#valid_110|]. (and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (select (store (store |v_#valid_110| |ULTIMATE.start_main_#t~malloc10.base| 1) |ULTIMATE.start_main_#t~malloc11.base| 1) |ULTIMATE.start_main_#t~malloc12.base|) 0) (= (let ((.cse0 (* ULTIMATE.start_main_~Alen~0 4))) (store (store (store |v_#length_80| |ULTIMATE.start_main_#t~malloc10.base| .cse0) |ULTIMATE.start_main_#t~malloc11.base| (* ULTIMATE.start_main_~Blen~0 4)) |ULTIMATE.start_main_#t~malloc12.base| .cse0)) |#length|) (<= ULTIMATE.start_diff_~l2~0 ULTIMATE.start_main_~Blen~0) unseeded (<= 1 ULTIMATE.start_main_~Blen~0)) [2020-07-29 01:35:47,480 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|ULTIMATE.start_main_#t~malloc10.base|, |ULTIMATE.start_main_#t~malloc12.base|]. (let ((.cse1 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|))) (let ((.cse0 (select |#length| |ULTIMATE.start_main_#t~malloc12.base|)) (.cse2 (div (* .cse1 (- 1)) (- 4)))) (and (= 0 (mod (* .cse0 3) (- 4))) (= 0 (mod (* .cse1 3) (- 4))) (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (not (= |ULTIMATE.start_main_#t~malloc11.base| |ULTIMATE.start_main_#t~malloc12.base|)) (<= ULTIMATE.start_diff_~l2~0 .cse2) (not (= |ULTIMATE.start_main_#t~malloc10.base| |ULTIMATE.start_main_#t~malloc12.base|)) (or (= (select |#length| |ULTIMATE.start_main_#t~malloc10.base|) (* (div (- .cse0) (- 4)) 4)) (= |ULTIMATE.start_main_#t~malloc10.base| |ULTIMATE.start_main_#t~malloc11.base|)) unseeded (<= 1 .cse2)))) [2020-07-29 01:35:47,498 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:47,573 INFO L280 TraceCheckUtils]: 0: Hoare triple {469#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {469#unseeded} is VALID [2020-07-29 01:35:47,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {469#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; {469#unseeded} is VALID [2020-07-29 01:35:47,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {469#unseeded} assume !(main_~Alen~0 < 1); {469#unseeded} is VALID [2020-07-29 01:35:47,578 INFO L280 TraceCheckUtils]: 3: Hoare triple {469#unseeded} assume !(main_~Blen~0 < 1); {582#(and unseeded (<= 1 ULTIMATE.start_main_~Blen~0))} is VALID [2020-07-29 01:35:47,582 INFO L280 TraceCheckUtils]: 4: Hoare triple {582#(and unseeded (<= 1 ULTIMATE.start_main_~Blen~0))} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; {586#(and (= 0 (mod (* (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 3) (- 4))) (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (exists ((|ULTIMATE.start_main_#t~malloc12.base| Int) (|ULTIMATE.start_main_#t~malloc10.base| Int)) (and (= 0 (mod (* (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) 3) (- 4))) (or (= (select |#length| |ULTIMATE.start_main_#t~malloc10.base|) (* 4 (div (* (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (- 1)) (- 4)))) (= |ULTIMATE.start_main_#t~malloc10.base| |ULTIMATE.start_main_#t~malloc11.base|)) (not (= |ULTIMATE.start_main_#t~malloc11.base| |ULTIMATE.start_main_#t~malloc12.base|)) (not (= |ULTIMATE.start_main_#t~malloc10.base| |ULTIMATE.start_main_#t~malloc12.base|)))) (<= ULTIMATE.start_diff_~l2~0 (div (* (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (- 1)) (- 4))) unseeded (<= 1 (div (* (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (- 1)) (- 4))))} is VALID [2020-07-29 01:35:47,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {586#(and (= 0 (mod (* (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 3) (- 4))) (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (exists ((|ULTIMATE.start_main_#t~malloc12.base| Int) (|ULTIMATE.start_main_#t~malloc10.base| Int)) (and (= 0 (mod (* (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) 3) (- 4))) (or (= (select |#length| |ULTIMATE.start_main_#t~malloc10.base|) (* 4 (div (* (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (- 1)) (- 4)))) (= |ULTIMATE.start_main_#t~malloc10.base| |ULTIMATE.start_main_#t~malloc11.base|)) (not (= |ULTIMATE.start_main_#t~malloc11.base| |ULTIMATE.start_main_#t~malloc12.base|)) (not (= |ULTIMATE.start_main_#t~malloc10.base| |ULTIMATE.start_main_#t~malloc12.base|)))) (<= ULTIMATE.start_diff_~l2~0 (div (* (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (- 1)) (- 4))) unseeded (<= 1 (div (* (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (- 1)) (- 4))))} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {564#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (>= (+ (* (- 2) ULTIMATE.start_diff_~l2~0) (select |#length| ULTIMATE.start_diff_~B.base)) 0) unseeded)} is VALID [2020-07-29 01:35:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:35:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:47,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {565#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (>= (+ (* (- 2) ULTIMATE.start_diff_~l2~0) (select |#length| ULTIMATE.start_diff_~B.base)) 0) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* (- 2) ULTIMATE.start_diff_~j~0))))} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {590#(and (<= (* 2 ULTIMATE.start_diff_~l2~0) (select |#length| ULTIMATE.start_diff_~B.base)) (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (< ULTIMATE.start_diff_~j~0 ULTIMATE.start_diff_~l2~0) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (+ (* 2 ULTIMATE.start_diff_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:47,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {590#(and (<= (* 2 ULTIMATE.start_diff_~l2~0) (select |#length| ULTIMATE.start_diff_~B.base)) (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (< ULTIMATE.start_diff_~j~0 ULTIMATE.start_diff_~l2~0) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (+ (* 2 ULTIMATE.start_diff_~j~0) oldRank0)))} assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; {567#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* (- 2) ULTIMATE.start_diff_~j~0)))) unseeded) (>= (+ (* (- 2) ULTIMATE.start_diff_~l2~0) (select |#length| ULTIMATE.start_diff_~B.base)) 0))} is VALID [2020-07-29 01:35:47,629 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-29 01:35:47,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:35:47,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:47,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:47,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,648 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 01:35:47,649 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-29 01:35:47,859 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 38 states and 53 transitions. Complement of second has 9 states. [2020-07-29 01:35:47,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:47,859 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:47,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:47,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:47,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:47,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:35:47,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:47,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:47,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:47,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2020-07-29 01:35:47,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:47,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:47,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:47,864 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 23 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:47,864 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:47,864 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:35:47,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:47,866 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:47,866 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2020-07-29 01:35:47,867 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:47,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:47,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:47,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:47,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:35:47,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:35:47,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:35:47,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:47,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:47,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:47,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:35:47,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:35:47,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:35:47,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:35:47,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:35:47,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:35:47,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:47,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:47,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:47,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:47,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:47,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:47,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:47,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:47,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:47,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:35:47,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:35:47,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:35:47,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:47,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:47,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:47,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:47,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:47,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:47,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,880 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:35:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-29 01:35:47,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:47,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:47,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:35:47,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2020-07-29 01:35:47,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:47,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2020-07-29 01:35:47,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:35:47,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:35:47,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2020-07-29 01:35:47,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:47,887 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2020-07-29 01:35:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2020-07-29 01:35:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2020-07-29 01:35:47,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:47,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 39 transitions. Second operand 20 states. [2020-07-29 01:35:47,889 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 39 transitions. Second operand 20 states. [2020-07-29 01:35:47,889 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 20 states. [2020-07-29 01:35:47,890 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:47,892 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2020-07-29 01:35:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-07-29 01:35:47,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:47,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:47,893 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 27 states and 39 transitions. [2020-07-29 01:35:47,893 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 27 states and 39 transitions. [2020-07-29 01:35:47,893 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:47,896 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2020-07-29 01:35:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-07-29 01:35:47,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:47,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:47,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:47,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:35:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-07-29 01:35:47,897 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 01:35:47,898 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 01:35:47,898 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:35:47,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-07-29 01:35:47,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:47,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:47,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:47,899 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:47,899 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:47,899 INFO L794 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 648#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 649#L574 assume !(main_~Alen~0 < 1); 654#L574-2 assume !(main_~Blen~0 < 1); 662#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 658#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 659#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 666#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 667#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 664#L557-2 assume !(0 == diff_~found~0); 655#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 656#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 651#L558-2 [2020-07-29 01:35:47,899 INFO L796 eck$LassoCheckResult]: Loop: 651#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 650#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 651#L558-2 [2020-07-29 01:35:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:47,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2020-07-29 01:35:47,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:47,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608572608] [2020-07-29 01:35:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {786#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {786#true} is VALID [2020-07-29 01:35:47,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {786#true} havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; {786#true} is VALID [2020-07-29 01:35:47,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {786#true} assume !(main_~Alen~0 < 1); {786#true} is VALID [2020-07-29 01:35:47,928 INFO L280 TraceCheckUtils]: 3: Hoare triple {786#true} assume !(main_~Blen~0 < 1); {786#true} is VALID [2020-07-29 01:35:47,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {786#true} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; {786#true} is VALID [2020-07-29 01:35:47,929 INFO L280 TraceCheckUtils]: 5: Hoare triple {786#true} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {788#(= 0 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 01:35:47,929 INFO L280 TraceCheckUtils]: 6: Hoare triple {788#(= 0 ULTIMATE.start_diff_~found~0)} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {788#(= 0 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 01:35:47,930 INFO L280 TraceCheckUtils]: 7: Hoare triple {788#(= 0 ULTIMATE.start_diff_~found~0)} assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; {788#(= 0 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 01:35:47,931 INFO L280 TraceCheckUtils]: 8: Hoare triple {788#(= 0 ULTIMATE.start_diff_~found~0)} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {788#(= 0 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 01:35:47,931 INFO L280 TraceCheckUtils]: 9: Hoare triple {788#(= 0 ULTIMATE.start_diff_~found~0)} assume !(0 == diff_~found~0); {787#false} is VALID [2020-07-29 01:35:47,931 INFO L280 TraceCheckUtils]: 10: Hoare triple {787#false} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {787#false} is VALID [2020-07-29 01:35:47,932 INFO L280 TraceCheckUtils]: 11: Hoare triple {787#false} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {787#false} is VALID [2020-07-29 01:35:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:35:47,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608572608] [2020-07-29 01:35:47,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:47,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:35:47,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494363385] [2020-07-29 01:35:47,933 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:35:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2020-07-29 01:35:47,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:47,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750436784] [2020-07-29 01:35:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:47,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:47,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:47,943 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:48,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:48,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:35:48,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:35:48,008 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-29 01:35:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:48,042 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2020-07-29 01:35:48,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:35:48,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:48,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:48,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2020-07-29 01:35:48,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:48,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2020-07-29 01:35:48,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:35:48,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:35:48,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-07-29 01:35:48,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:48,062 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-07-29 01:35:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-07-29 01:35:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-29 01:35:48,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:48,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 31 transitions. Second operand 20 states. [2020-07-29 01:35:48,063 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 31 transitions. Second operand 20 states. [2020-07-29 01:35:48,063 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 20 states. [2020-07-29 01:35:48,064 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:48,065 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2020-07-29 01:35:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:35:48,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:48,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:48,066 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states and 31 transitions. [2020-07-29 01:35:48,066 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states and 31 transitions. [2020-07-29 01:35:48,067 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:48,068 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2020-07-29 01:35:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:35:48,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:48,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:48,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:48,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:35:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2020-07-29 01:35:48,070 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-07-29 01:35:48,070 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-07-29 01:35:48,070 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:35:48,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2020-07-29 01:35:48,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:48,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:48,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:48,071 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:48,071 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:48,072 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 813#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 814#L574 assume !(main_~Alen~0 < 1); 819#L574-2 assume !(main_~Blen~0 < 1); 827#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 823#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 824#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 832#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 830#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 828#L557-2 assume !(0 == diff_~found~0); 820#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 821#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 816#L558-2 [2020-07-29 01:35:48,072 INFO L796 eck$LassoCheckResult]: Loop: 816#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 815#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 816#L558-2 [2020-07-29 01:35:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2020-07-29 01:35:48,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:48,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457190600] [2020-07-29 01:35:48,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,110 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,115 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:48,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2020-07-29 01:35:48,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:48,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925983764] [2020-07-29 01:35:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:48,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2020-07-29 01:35:48,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:48,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473491408] [2020-07-29 01:35:48,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,158 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:48,794 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 132 [2020-07-29 01:35:49,008 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-07-29 01:35:49,012 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:49,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:49,012 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:49,012 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:49,012 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:49,012 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:49,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:49,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:49,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration7_Lasso [2020-07-29 01:35:49,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:49,013 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:49,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,536 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2020-07-29 01:35:49,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:49,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:50,159 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-07-29 01:35:50,578 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-07-29 01:35:50,773 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:50,773 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:50,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:50,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:50,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:50,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:50,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:50,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:50,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:50,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:50,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:50,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:50,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:50,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:50,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:50,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:50,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:50,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:50,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:50,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:50,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:50,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:50,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:50,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:50,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:50,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:50,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:50,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:50,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:50,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:50,865 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:35:50,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:50,873 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:35:50,873 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:35:50,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:50,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:50,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:50,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:50,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:50,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:50,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:50,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:50,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:50,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:50,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:50,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:50,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:50,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:50,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:50,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:50,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:50,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:51,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:51,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:51,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:51,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:51,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:51,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:51,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:51,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:51,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:51,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:51,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:51,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:51,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:51,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:51,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:51,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:51,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:51,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:51,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:51,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:51,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:51,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:51,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:51,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:51,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:51,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:51,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:51,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:51,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:51,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:51,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:51,242 INFO L443 ModelExtractionUtils]: Simplification made 36 calls to the SMT solver. [2020-07-29 01:35:51,242 INFO L444 ModelExtractionUtils]: 15 out of 64 variables were initially zero. Simplification set additionally 45 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:51,247 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:51,249 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:51,249 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:51,249 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3 + 4*ULTIMATE.start_diff_~i~0 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2020-07-29 01:35:51,343 INFO L297 tatePredicateManager]: 16 out of 18 supporting invariants were superfluous and have been removed [2020-07-29 01:35:51,352 INFO L393 LassoCheck]: Loop: "assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4);" "assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4;" [2020-07-29 01:35:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:35:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-29 01:35:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:51,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {942#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {942#unseeded} is VALID [2020-07-29 01:35:51,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {942#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; {942#unseeded} is VALID [2020-07-29 01:35:51,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {942#unseeded} assume !(main_~Alen~0 < 1); {942#unseeded} is VALID [2020-07-29 01:35:51,456 INFO L280 TraceCheckUtils]: 3: Hoare triple {942#unseeded} assume !(main_~Blen~0 < 1); {942#unseeded} is VALID [2020-07-29 01:35:51,457 INFO L280 TraceCheckUtils]: 4: Hoare triple {942#unseeded} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,457 INFO L280 TraceCheckUtils]: 5: Hoare triple {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,458 INFO L280 TraceCheckUtils]: 6: Hoare triple {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,459 INFO L280 TraceCheckUtils]: 8: Hoare triple {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !(0 == diff_~found~0); {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,462 INFO L280 TraceCheckUtils]: 11: Hoare triple {1068#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1047#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset))} is VALID [2020-07-29 01:35:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:35:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:51,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {1048#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* 4 ULTIMATE.start_diff_~i~0) (* (- 4) ULTIMATE.start_diff_~j~0))) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset))} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {1090#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (+ (* 4 ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~B.offset 4) (select |#length| ULTIMATE.start_diff_~B.base)) (<= 0 (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset)) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (+ (* 4 ULTIMATE.start_diff_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:51,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {1090#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (+ (* 4 ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~B.offset 4) (select |#length| ULTIMATE.start_diff_~B.base)) (<= 0 (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset)) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (+ (* 4 ULTIMATE.start_diff_~j~0) oldRank0)))} assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; {1050#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* 4 ULTIMATE.start_diff_~i~0) (* (- 4) ULTIMATE.start_diff_~j~0))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset))} is VALID [2020-07-29 01:35:51,514 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-29 01:35:51,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:51,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:51,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:35:51,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:35:51,638 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 32 states and 42 transitions. Complement of second has 8 states. [2020-07-29 01:35:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:51,639 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:51,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:51,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:51,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:51,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:51,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:51,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:51,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:51,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-07-29 01:35:51,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:51,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:51,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:51,643 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:51,643 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:51,643 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:51,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:51,644 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:51,644 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 42 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:51,645 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:51,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:35:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:35:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:35:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:51,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:51,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:51,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:51,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,658 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-07-29 01:35:51,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,659 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:35:51,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-29 01:35:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:51,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {942#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {942#unseeded} is VALID [2020-07-29 01:35:51,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {942#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; {942#unseeded} is VALID [2020-07-29 01:35:51,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {942#unseeded} assume !(main_~Alen~0 < 1); {942#unseeded} is VALID [2020-07-29 01:35:51,755 INFO L280 TraceCheckUtils]: 3: Hoare triple {942#unseeded} assume !(main_~Blen~0 < 1); {942#unseeded} is VALID [2020-07-29 01:35:51,757 INFO L280 TraceCheckUtils]: 4: Hoare triple {942#unseeded} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,758 INFO L280 TraceCheckUtils]: 6: Hoare triple {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,759 INFO L280 TraceCheckUtils]: 7: Hoare triple {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,759 INFO L280 TraceCheckUtils]: 8: Hoare triple {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,760 INFO L280 TraceCheckUtils]: 9: Hoare triple {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !(0 == diff_~found~0); {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,760 INFO L280 TraceCheckUtils]: 10: Hoare triple {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:51,761 INFO L280 TraceCheckUtils]: 11: Hoare triple {1156#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1047#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset))} is VALID [2020-07-29 01:35:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:35:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:51,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {1048#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* 4 ULTIMATE.start_diff_~i~0) (* (- 4) ULTIMATE.start_diff_~j~0))) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset))} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {1178#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (+ (* 4 ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~B.offset 4) (select |#length| ULTIMATE.start_diff_~B.base)) (<= 0 (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset)) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (+ (* 4 ULTIMATE.start_diff_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:51,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {1178#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (+ (* 4 ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~B.offset 4) (select |#length| ULTIMATE.start_diff_~B.base)) (<= 0 (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset)) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (+ (* 4 ULTIMATE.start_diff_~j~0) oldRank0)))} assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; {1050#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* 4 ULTIMATE.start_diff_~i~0) (* (- 4) ULTIMATE.start_diff_~j~0))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset))} is VALID [2020-07-29 01:35:51,809 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-29 01:35:51,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:51,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:51,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,830 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:35:51,830 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:35:51,920 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 32 states and 42 transitions. Complement of second has 8 states. [2020-07-29 01:35:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:51,921 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:51,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:51,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:51,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:51,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:51,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:51,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:51,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:51,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-07-29 01:35:51,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:51,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:51,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:51,925 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:51,925 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:51,925 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:51,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:51,926 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:51,926 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 42 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:51,927 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:51,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:35:51,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:35:51,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:35:51,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:51,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:51,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:51,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:51,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:51,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:51,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,939 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-07-29 01:35:51,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:51,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:51,941 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:35:51,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:51,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-29 01:35:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:52,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:52,044 INFO L280 TraceCheckUtils]: 0: Hoare triple {942#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {942#unseeded} is VALID [2020-07-29 01:35:52,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {942#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; {942#unseeded} is VALID [2020-07-29 01:35:52,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {942#unseeded} assume !(main_~Alen~0 < 1); {942#unseeded} is VALID [2020-07-29 01:35:52,046 INFO L280 TraceCheckUtils]: 3: Hoare triple {942#unseeded} assume !(main_~Blen~0 < 1); {942#unseeded} is VALID [2020-07-29 01:35:52,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {942#unseeded} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:52,048 INFO L280 TraceCheckUtils]: 5: Hoare triple {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:52,049 INFO L280 TraceCheckUtils]: 6: Hoare triple {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:52,049 INFO L280 TraceCheckUtils]: 7: Hoare triple {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:52,050 INFO L280 TraceCheckUtils]: 8: Hoare triple {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:52,051 INFO L280 TraceCheckUtils]: 9: Hoare triple {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !(0 == diff_~found~0); {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:52,052 INFO L280 TraceCheckUtils]: 10: Hoare triple {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} is VALID [2020-07-29 01:35:52,053 INFO L280 TraceCheckUtils]: 11: Hoare triple {1244#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (= 0 ULTIMATE.start_diff_~B.offset) (= 0 ULTIMATE.start_diff_~A.offset) unseeded)} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1047#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset))} is VALID [2020-07-29 01:35:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:52,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:35:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:52,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:52,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {1048#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* 4 ULTIMATE.start_diff_~i~0) (* (- 4) ULTIMATE.start_diff_~j~0))) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset))} assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); {1266#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (+ (* 4 ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~B.offset 4) (select |#length| ULTIMATE.start_diff_~B.base)) (<= 0 (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset)) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (+ (* 4 ULTIMATE.start_diff_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:52,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (+ (* 4 ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~B.offset 4) (select |#length| ULTIMATE.start_diff_~B.base)) (<= 0 (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset)) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (+ (* 4 ULTIMATE.start_diff_~j~0) oldRank0)))} assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; {1050#(and (= ULTIMATE.start_diff_~B.base |ULTIMATE.start_main_#t~malloc11.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* 4 ULTIMATE.start_diff_~i~0) (* (- 4) ULTIMATE.start_diff_~j~0))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_diff_~A.offset ULTIMATE.start_diff_~B.offset))} is VALID [2020-07-29 01:35:52,105 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-29 01:35:52,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:52,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:52,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:52,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,123 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:35:52,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:35:52,238 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 31 states and 45 transitions. Complement of second has 7 states. [2020-07-29 01:35:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:52,238 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:52,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:52,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:52,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:52,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:52,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:52,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:52,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:52,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2020-07-29 01:35:52,241 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:52,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:52,241 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:52,242 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:52,242 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:52,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:52,243 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:52,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 45 transitions. cyclomatic complexity: 17 [2020-07-29 01:35:52,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. cyclomatic complexity: 17 [2020-07-29 01:35:52,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:52,244 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:35:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:52,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:35:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:35:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:35:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:52,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:52,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:52,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:52,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:52,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:52,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:52,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,253 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-29 01:35:52,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:52,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:35:52,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:35:52,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:52,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. cyclomatic complexity: 17 [2020-07-29 01:35:52,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:52,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2020-07-29 01:35:52,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:52,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:52,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:52,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:52,258 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:52,258 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:52,258 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:52,258 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:35:52,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:52,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:52,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:52,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:52 BoogieIcfgContainer [2020-07-29 01:35:52,265 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:52,266 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:52,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:52,266 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:52,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:38" (3/4) ... [2020-07-29 01:35:52,270 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:52,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:52,272 INFO L168 Benchmark]: Toolchain (without parser) took 15164.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.3 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:52,273 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:52,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:52,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:52,274 INFO L168 Benchmark]: Boogie Preprocessor took 30.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:52,275 INFO L168 Benchmark]: RCFGBuilder took 488.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:52,275 INFO L168 Benchmark]: BuchiAutomizer took 13979.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -46.4 MB). Peak memory consumption was 184.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:52,276 INFO L168 Benchmark]: Witness Printer took 4.74 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:52,279 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 603.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 488.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13979.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -46.4 MB). Peak memory consumption was 184.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.74 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[A] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (Blen * sizeof(int))] + -2 * j and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (Blen * sizeof(int))] + 4 * i + -4 * j and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 11.2s. Construction of modules took 0.2s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 114 SDtfs, 115 SDslu, 61 SDs, 0 SdLazy, 91 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital264 mio100 ax106 hnf99 lsp84 ukn87 mio100 lsp50 div100 bol100 ite100 ukn100 eq185 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...