./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/array-memsafety/stroeder2-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash eb1b14e8511764ce20ab6a88d1bf2bef8398fca052e797a3c06b53051dc2f2a5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:33,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:33,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:33,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:33,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:33,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:33,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:33,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:33,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:33,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:33,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:33,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:33,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:33,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:33,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:33,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:33,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:33,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:33,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:33,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:33,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:33,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:33,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:33,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:33,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:33,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:33,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:33,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:33,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:33,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:33,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:33,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:33,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:33,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:33,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:33,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:33,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:33,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:33,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:33,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:33,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:33,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:33,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:33,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:33,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:33,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:33,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:33,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:33,719 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:33,719 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:33,719 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:33,719 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:33,720 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:33,720 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:33,720 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:33,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:33,721 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:33,721 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:33,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:33,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:33,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:33,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:33,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:33,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:33,722 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:33,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:33,722 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:33,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:33,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:33,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:33,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:33,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:33,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:33,724 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:33,724 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb1b14e8511764ce20ab6a88d1bf2bef8398fca052e797a3c06b53051dc2f2a5 [2022-02-21 04:35:33,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:33,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:33,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:33,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:33,943 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:33,943 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2022-02-21 04:35:33,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3a13873/edc62d7e8221409f8c3b215ce049c99c/FLAGfae25ee72 [2022-02-21 04:35:34,413 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:34,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2022-02-21 04:35:34,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3a13873/edc62d7e8221409f8c3b215ce049c99c/FLAGfae25ee72 [2022-02-21 04:35:34,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3a13873/edc62d7e8221409f8c3b215ce049c99c [2022-02-21 04:35:34,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:34,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:34,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:34,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:34,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:34,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:34,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2ebf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34, skipping insertion in model container [2022-02-21 04:35:34,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:34,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:34,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:35,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:35,127 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:35,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:35,189 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:35,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35 WrapperNode [2022-02-21 04:35:35,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:35,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:35,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:35,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:35,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,253 INFO L137 Inliner]: procedures = 116, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-02-21 04:35:35,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:35,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:35,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:35,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:35,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:35,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:35,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:35,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:35,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (1/1) ... [2022-02-21 04:35:35,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:35,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:35:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:35,468 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:35,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:35,621 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:35,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:35,626 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 04:35:35,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:35 BoogieIcfgContainer [2022-02-21 04:35:35,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:35,628 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:35,628 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:35,637 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:35,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:35,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:34" (1/3) ... [2022-02-21 04:35:35,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@372b781b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:35, skipping insertion in model container [2022-02-21 04:35:35,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:35,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:35" (2/3) ... [2022-02-21 04:35:35,640 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@372b781b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:35, skipping insertion in model container [2022-02-21 04:35:35,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:35,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:35" (3/3) ... [2022-02-21 04:35:35,641 INFO L388 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca-1.i [2022-02-21 04:35:35,688 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:35,688 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:35,688 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:35,689 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:35,689 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:35,689 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:35,689 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:35,689 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:35,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:35,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:35,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:35,745 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:35:35,745 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:35,745 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:35,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:35,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:35,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:35,755 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:35:35,755 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:35,762 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 9#L529true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 17#L529-2true call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 3#L534-3true [2022-02-21 04:35:35,763 INFO L793 eck$LassoCheckResult]: Loop: 3#L534-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 12#L534-2true main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3#L534-3true [2022-02-21 04:35:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 04:35:35,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:35,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324820730] [2022-02-21 04:35:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:35,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,909 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,951 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:35,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-02-21 04:35:35,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:35,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881508803] [2022-02-21 04:35:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:35,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:36,001 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:36,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-02-21 04:35:36,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:36,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418023522] [2022-02-21 04:35:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:36,040 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:36,071 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:36,296 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:36,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:36,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:36,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:36,297 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:36,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:36,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:36,298 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration1_Lasso [2022-02-21 04:35:36,298 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:36,298 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:36,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,739 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:36,742 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:36,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:36,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:36,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:36,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:35:36,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:36,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:35:36,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:35:36,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:36,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:36,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:36,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:36,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:36,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:36,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:36,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:36,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:36,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:36,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:35:36,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:36,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:36,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:36,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:36,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:36,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:36,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:36,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:37,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:37,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:37,020 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:37,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:37,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:37,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:37,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:37,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:37,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:37,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:37,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:37,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:37,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:37,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:37,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:37,081 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:37,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:37,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:37,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:37,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:37,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:37,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:37,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:37,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:37,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:37,162 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-02-21 04:35:37,162 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-02-21 04:35:37,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:37,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:37,219 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:37,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:37,228 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:37,244 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:37,244 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:37,245 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1) = -4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0#1.offset >= 0] [2022-02-21 04:35:37,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:37,283 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 04:35:37,291 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2022-02-21 04:35:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:37,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 04:35:37,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {26#unseeded} is VALID [2022-02-21 04:35:37,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {26#unseeded} is VALID [2022-02-21 04:35:37,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#unseeded} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; {60#(and unseeded (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:35:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:37,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* (- 4) |ULTIMATE.start_main_~i~1#1|))) (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; {78#(and (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4 |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| (- 4)))))} is VALID [2022-02-21 04:35:37,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#(and (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4 |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| (- 4)))))} main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {63#(and (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* (- 4) |ULTIMATE.start_main_~i~1#1|)))) unseeded))} is VALID [2022-02-21 04:35:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:37,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:37,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,444 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 [2022-02-21 04:35:37,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,521 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 53 transitions. Complement of second has 7 states. [2022-02-21 04:35:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:37,521 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:37,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:37,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:37,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2022-02-21 04:35:37,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:37,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,529 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:37,531 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 04:35:37,531 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:37,532 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:37,532 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2022-02-21 04:35:37,533 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:37,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:37,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:37,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:37,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:37,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:37,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:37,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:37,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:37,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:37,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:37,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:37,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:37,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:37,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:37,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:37,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:37,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:37,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:37,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:37,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:37,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:37,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:37,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:37,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:37,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:37,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:37,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:37,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:37,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:37,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:37,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:37,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:37,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:37,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:37,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:37,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:37,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,549 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-21 04:35:37,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:37,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2022-02-21 04:35:37,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:37,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2022-02-21 04:35:37,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:35:37,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:37,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 04:35:37,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:37,560 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 04:35:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 04:35:37,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:37,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,575 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,577 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,579 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 04:35:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:37,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 04:35:37,580 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 04:35:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,581 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 04:35:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:37,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:37,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 04:35:37,582 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:37,582 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:37,583 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:37,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:37,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:37,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,583 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:37,584 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:35:37,584 INFO L791 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 140#L529 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 141#L529-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 131#L534-3 assume !(main_~i~1#1 < main_~array_size~0#1); 133#L534-4 assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; 142#L517-3 [2022-02-21 04:35:37,584 INFO L793 eck$LassoCheckResult]: Loop: 142#L517-3 assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; 137#L520-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 138#L520-1 assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; 139#L517-2 sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; 142#L517-3 [2022-02-21 04:35:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,584 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-02-21 04:35:37,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537617766] [2022-02-21 04:35:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {170#true} is VALID [2022-02-21 04:35:37,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {170#true} is VALID [2022-02-21 04:35:37,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {172#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 04:35:37,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; {173#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-21 04:35:37,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {173#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} assume !(main_~i~1#1 < main_~array_size~0#1); {171#false} is VALID [2022-02-21 04:35:37,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#false} assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; {171#false} is VALID [2022-02-21 04:35:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:37,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:37,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537617766] [2022-02-21 04:35:37,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537617766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:37,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:37,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:37,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006535095] [2022-02-21 04:35:37,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:37,631 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2022-02-21 04:35:37,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918733786] [2022-02-21 04:35:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,642 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:37,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:37,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:37,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:37,688 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,715 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:35:37,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:37,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-02-21 04:35:37,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:37,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2022-02-21 04:35:37,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:37,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:37,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-02-21 04:35:37,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:37,722 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 04:35:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-02-21 04:35:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-02-21 04:35:37,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:37,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,724 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,724 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,724 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:37,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 16 transitions. [2022-02-21 04:35:37,725 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 16 transitions. [2022-02-21 04:35:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,726 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:37,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:37,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 04:35:37,727 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 04:35:37,727 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 04:35:37,727 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:37,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 04:35:37,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:37,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,728 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:37,728 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:35:37,728 INFO L791 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 198#L529 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 199#L529-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 189#L534-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 190#L534-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 191#L534-3 assume !(main_~i~1#1 < main_~array_size~0#1); 192#L534-4 assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; 200#L517-3 [2022-02-21 04:35:37,728 INFO L793 eck$LassoCheckResult]: Loop: 200#L517-3 assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; 195#L520-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 196#L520-1 assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; 197#L517-2 sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; 200#L517-3 [2022-02-21 04:35:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-02-21 04:35:37,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524956011] [2022-02-21 04:35:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,742 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,759 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2022-02-21 04:35:37,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618316625] [2022-02-21 04:35:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,766 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,770 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2022-02-21 04:35:37,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497211336] [2022-02-21 04:35:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,798 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:38,097 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:38,098 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:38,098 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:38,098 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:38,098 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:38,098 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,098 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:38,098 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:38,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration3_Lasso [2022-02-21 04:35:38,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:38,098 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:38,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,287 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:38,289 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:38,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,666 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:38,666 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:38,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,684 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:38,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:38,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:38,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:38,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:38,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,761 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:38,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:35:38,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:38,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:38,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:38,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:38,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,799 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:38,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:35:38,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:38,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:38,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:38,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,871 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:38,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:35:38,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:38,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:38,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:38,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:38,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,916 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:38,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:35:38,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:38,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:38,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:38,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,966 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:38,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:35:38,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:38,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:38,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,019 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:35:39,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,087 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:35:39,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:39,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:39,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:39,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,122 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:35:39,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:39,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:39,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:39,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,150 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:35:39,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:39,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:39,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:39,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:35:39,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,217 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:35:39,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,331 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:35:39,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,398 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:35:39,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:35:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,452 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:35:39,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 04:35:39,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,499 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:35:39,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,557 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:39,583 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 04:35:39,583 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 04:35:39,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,585 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:39,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:35:39,633 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:39,633 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:39,633 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~i~0#1, ULTIMATE.start_sumOfThirdBytes_~array_size#1) = -1*ULTIMATE.start_sumOfThirdBytes_~i~0#1 + 1*ULTIMATE.start_sumOfThirdBytes_~array_size#1 Supporting invariants [] [2022-02-21 04:35:39,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 04:35:39,660 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 04:35:39,663 INFO L390 LassoCheck]: Loop: "assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset;" "call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);" "assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1;" "sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1;" [2022-02-21 04:35:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:39,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {236#unseeded} is VALID [2022-02-21 04:35:39,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {236#unseeded} is VALID [2022-02-21 04:35:39,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {236#unseeded} is VALID [2022-02-21 04:35:39,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {236#unseeded} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; {236#unseeded} is VALID [2022-02-21 04:35:39,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {236#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; {236#unseeded} is VALID [2022-02-21 04:35:39,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#unseeded} main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {236#unseeded} is VALID [2022-02-21 04:35:39,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#unseeded} assume !(main_~i~1#1 < main_~array_size~0#1); {236#unseeded} is VALID [2022-02-21 04:35:39,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#unseeded} assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; {236#unseeded} is VALID [2022-02-21 04:35:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:39,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#(>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|)))} assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; {285#(and (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))))} is VALID [2022-02-21 04:35:39,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#(and (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))))} call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); {285#(and (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))))} is VALID [2022-02-21 04:35:39,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#(and (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))))} assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; {285#(and (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))))} is VALID [2022-02-21 04:35:39,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {285#(and (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))))} sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; {259#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|)))))} is VALID [2022-02-21 04:35:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:39,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:39,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:39,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,764 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 [2022-02-21 04:35:39,764 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,784 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 22 transitions. Complement of second has 4 states. [2022-02-21 04:35:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:39,784 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:39,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:39,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2022-02-21 04:35:39,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,786 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:39,787 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:39,787 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,787 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:39,788 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:39,788 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:39,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:39,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:39,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:39,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:39,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:39,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:39,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:39,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:39,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:39,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:39,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:39,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:39,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:39,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,797 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 04:35:39,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:39,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:39,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:35:39,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:39,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 21 transitions. [2022-02-21 04:35:39,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:35:39,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:39,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2022-02-21 04:35:39,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:39,800 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 04:35:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2022-02-21 04:35:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-02-21 04:35:39,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:39,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,801 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,801 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,802 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:39,803 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2022-02-21 04:35:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-02-21 04:35:39,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:39,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:39,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 21 transitions. [2022-02-21 04:35:39,804 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 21 transitions. [2022-02-21 04:35:39,804 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:39,805 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 04:35:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 04:35:39,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:39,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:39,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:39,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-02-21 04:35:39,807 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 04:35:39,807 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 04:35:39,807 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:39,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-02-21 04:35:39,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,808 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:39,808 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:39,808 INFO L791 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 329#L529 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 330#L529-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 318#L534-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 319#L534-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 320#L534-3 assume !(main_~i~1#1 < main_~array_size~0#1); 321#L534-4 assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; 331#L517-3 assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; 324#L520-3 [2022-02-21 04:35:39,808 INFO L793 eck$LassoCheckResult]: Loop: 324#L520-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 325#L520-1 assume !!(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1;sumOfThirdBytes_#t~post4#1 := sumOfThirdBytes_~sum~0#1;sumOfThirdBytes_~sum~0#1 := 1 + sumOfThirdBytes_#t~post4#1;havoc sumOfThirdBytes_#t~post4#1;call sumOfThirdBytes_#t~mem5#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);sumOfThirdBytes_#t~post6#1 := sumOfThirdBytes_#t~mem5#1;call write~int(sumOfThirdBytes_#t~post6#1 - 1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);havoc sumOfThirdBytes_#t~mem5#1;havoc sumOfThirdBytes_#t~post6#1; 324#L520-3 [2022-02-21 04:35:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2022-02-21 04:35:39,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:39,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165180216] [2022-02-21 04:35:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,831 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2022-02-21 04:35:39,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:39,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619229055] [2022-02-21 04:35:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,841 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2022-02-21 04:35:39,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:39,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996465226] [2022-02-21 04:35:39,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,883 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:40,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,175 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:40,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:40,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:40,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:40,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:40,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:40,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:40,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration4_Lasso [2022-02-21 04:35:40,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:40,176 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:40,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,336 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:40,337 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:40,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,666 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:40,666 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:40,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,670 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:35:40,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:40,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:40,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:40,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,709 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:35:40,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:40,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:40,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:40,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 04:35:40,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,750 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 04:35:40,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:40,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:40,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 04:35:40,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,791 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 04:35:40,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:40,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:40,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:40,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:35:40,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,828 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:40,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:40,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 04:35:40,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:35:40,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,870 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:35:40,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:40,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:40,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,919 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:35:40,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:40,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:40,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:40,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:35:40,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,947 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 04:35:40,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:40,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:40,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:40,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,978 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:35:40,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:40,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:40,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:41,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 04:35:41,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,016 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:35:41,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:41,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:41,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:41,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:41,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:41,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:41,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:41,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:41,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:41,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:41,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,045 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:35:41,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:41,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:41,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:41,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:41,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:41,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:41,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:41,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:41,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:41,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,140 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:41,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:41,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:41,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:41,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:41,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:41,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:41,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:41,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:35:41,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:41,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:41,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,181 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:35:41,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:41,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:41,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:41,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:41,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:41,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:41,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:41,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:41,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:41,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,258 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:35:41,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:41,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:41,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:41,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:41,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:41,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:41,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:41,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:41,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 04:35:41,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,304 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:35:41,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:41,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:41,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:41,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:41,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:41,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:41,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:41,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:41,337 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:41,338 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:35:41,338 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:35:41,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,340 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:35:41,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:41,343 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:35:41,343 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:41,343 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0#1.base) ULTIMATE.start_sumOfThirdBytes_~p~0#1.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0#1.base) ULTIMATE.start_sumOfThirdBytes_~p~0#1.offset)_2 Supporting invariants [] [2022-02-21 04:35:41,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:41,382 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 04:35:41,385 INFO L390 LassoCheck]: Loop: "call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);" "assume !!(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1;sumOfThirdBytes_#t~post4#1 := sumOfThirdBytes_~sum~0#1;sumOfThirdBytes_~sum~0#1 := 1 + sumOfThirdBytes_#t~post4#1;havoc sumOfThirdBytes_#t~post4#1;call sumOfThirdBytes_#t~mem5#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);sumOfThirdBytes_#t~post6#1 := sumOfThirdBytes_#t~mem5#1;call write~int(sumOfThirdBytes_#t~post6#1 - 1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);havoc sumOfThirdBytes_#t~mem5#1;havoc sumOfThirdBytes_#t~post6#1;" [2022-02-21 04:35:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:41,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {424#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {424#unseeded} is VALID [2022-02-21 04:35:41,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {424#unseeded} is VALID [2022-02-21 04:35:41,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {424#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {424#unseeded} is VALID [2022-02-21 04:35:41,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {424#unseeded} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; {424#unseeded} is VALID [2022-02-21 04:35:41,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {424#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; {424#unseeded} is VALID [2022-02-21 04:35:41,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {424#unseeded} main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {424#unseeded} is VALID [2022-02-21 04:35:41,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {424#unseeded} assume !(main_~i~1#1 < main_~array_size~0#1); {424#unseeded} is VALID [2022-02-21 04:35:41,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {424#unseeded} assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; {424#unseeded} is VALID [2022-02-21 04:35:41,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#unseeded} assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; {424#unseeded} is VALID [2022-02-21 04:35:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:35:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:41,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_sumOfThirdBytes_~p~0#1.base|) |ULTIMATE.start_sumOfThirdBytes_~p~0#1.offset|))} call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); {491#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_sumOfThirdBytes_~p~0#1.base|) |ULTIMATE.start_sumOfThirdBytes_~p~0#1.offset|)) (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_sumOfThirdBytes_~p~0#1.base|) |ULTIMATE.start_sumOfThirdBytes_~p~0#1.offset|)))} is VALID [2022-02-21 04:35:41,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_sumOfThirdBytes_~p~0#1.base|) |ULTIMATE.start_sumOfThirdBytes_~p~0#1.offset|)) (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_sumOfThirdBytes_~p~0#1.base|) |ULTIMATE.start_sumOfThirdBytes_~p~0#1.offset|)))} assume !!(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1;sumOfThirdBytes_#t~post4#1 := sumOfThirdBytes_~sum~0#1;sumOfThirdBytes_~sum~0#1 := 1 + sumOfThirdBytes_#t~post4#1;havoc sumOfThirdBytes_#t~post4#1;call sumOfThirdBytes_#t~mem5#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);sumOfThirdBytes_#t~post6#1 := sumOfThirdBytes_#t~mem5#1;call write~int(sumOfThirdBytes_#t~post6#1 - 1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);havoc sumOfThirdBytes_#t~mem5#1;havoc sumOfThirdBytes_#t~post6#1; {462#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_sumOfThirdBytes_~p~0#1.base|) |ULTIMATE.start_sumOfThirdBytes_~p~0#1.offset|))) unseeded)} is VALID [2022-02-21 04:35:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:41,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,512 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 [2022-02-21 04:35:41,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,539 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 34 transitions. Complement of second has 7 states. [2022-02-21 04:35:41,539 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 [2022-02-21 04:35:41,539 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:41,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:41,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:41,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:41,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:41,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:41,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:41,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2022-02-21 04:35:41,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:41,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:41,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:41,540 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:41,540 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:41,540 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:41,541 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:41,541 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 34 transitions. cyclomatic complexity: 13 [2022-02-21 04:35:41,541 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:41,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:41,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:41,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:41,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:41,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:41,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:41,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:35:41,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:35:41,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:35:41,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:35:41,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:35:41,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:35:41,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:41,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:41,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:41,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:41,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:41,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:41,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:41,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:41,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:41,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:41,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:41,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:41,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,550 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-21 04:35:41,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:41,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:41,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:41,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. cyclomatic complexity: 13 [2022-02-21 04:35:41,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:41,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 26 transitions. [2022-02-21 04:35:41,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:35:41,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 04:35:41,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-02-21 04:35:41,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:41,554 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 04:35:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-02-21 04:35:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-02-21 04:35:41,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:41,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,559 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,559 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,559 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:41,573 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:35:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:35:41,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:41,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:41,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 04:35:41,574 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 04:35:41,574 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:41,575 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:35:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:35:41,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:41,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:41,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:41,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-02-21 04:35:41,576 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-21 04:35:41,577 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-21 04:35:41,577 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:41,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2022-02-21 04:35:41,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:41,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:41,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:41,577 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:41,578 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:41,578 INFO L791 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 543#L529 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 544#L529-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 531#L534-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 532#L534-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 533#L534-3 assume !(main_~i~1#1 < main_~array_size~0#1); 534#L534-4 assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; 545#L517-3 assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; 546#L520-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 541#L520-1 assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; 542#L517-2 sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; 547#L517-3 assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; 537#L520-3 [2022-02-21 04:35:41,578 INFO L793 eck$LassoCheckResult]: Loop: 537#L520-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 538#L520-1 assume !!(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1;sumOfThirdBytes_#t~post4#1 := sumOfThirdBytes_~sum~0#1;sumOfThirdBytes_~sum~0#1 := 1 + sumOfThirdBytes_#t~post4#1;havoc sumOfThirdBytes_#t~post4#1;call sumOfThirdBytes_#t~mem5#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);sumOfThirdBytes_#t~post6#1 := sumOfThirdBytes_#t~mem5#1;call write~int(sumOfThirdBytes_#t~post6#1 - 1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);havoc sumOfThirdBytes_#t~mem5#1;havoc sumOfThirdBytes_#t~post6#1; 537#L520-3 [2022-02-21 04:35:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2022-02-21 04:35:41,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:41,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559683558] [2022-02-21 04:35:41,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {648#true} is VALID [2022-02-21 04:35:41,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {648#true} is VALID [2022-02-21 04:35:41,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {648#true} is VALID [2022-02-21 04:35:41,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {648#true} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; {650#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (= (+ (* (- 1) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) 0))} is VALID [2022-02-21 04:35:41,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {650#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (= (+ (* (- 1) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; {650#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (= (+ (* (- 1) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) 0))} is VALID [2022-02-21 04:35:41,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (= (+ (* (- 1) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) 0))} main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {651#(and (<= |ULTIMATE.start_main_~i~1#1| (+ |ULTIMATE.start_main_~numbers~0#1.offset| 1)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:41,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {651#(and (<= |ULTIMATE.start_main_~i~1#1| (+ |ULTIMATE.start_main_~numbers~0#1.offset| 1)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !(main_~i~1#1 < main_~array_size~0#1); {652#(and (<= |ULTIMATE.start_main_~array_size~0#1| (+ |ULTIMATE.start_main_~numbers~0#1.offset| 1)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:41,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(and (<= |ULTIMATE.start_main_~array_size~0#1| (+ |ULTIMATE.start_main_~numbers~0#1.offset| 1)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} is VALID [2022-02-21 04:35:41,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} is VALID [2022-02-21 04:35:41,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} is VALID [2022-02-21 04:35:41,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} is VALID [2022-02-21 04:35:41,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; {654#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| |ULTIMATE.start_sumOfThirdBytes_~i~0#1|)} is VALID [2022-02-21 04:35:41,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {654#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| |ULTIMATE.start_sumOfThirdBytes_~i~0#1|)} assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; {649#false} is VALID [2022-02-21 04:35:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:41,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:41,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559683558] [2022-02-21 04:35:41,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559683558] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:41,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505533274] [2022-02-21 04:35:41,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 04:35:41,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:41,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,660 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-02-21 04:35:41,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 04:35:41,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 04:35:41,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:41,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {648#true} is VALID [2022-02-21 04:35:41,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {648#true} is VALID [2022-02-21 04:35:41,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {648#true} is VALID [2022-02-21 04:35:41,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {648#true} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; {667#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:41,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {667#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; {667#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:41,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {674#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:41,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < main_~array_size~0#1); {678#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} is VALID [2022-02-21 04:35:41,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; {682#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 0 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} is VALID [2022-02-21 04:35:41,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 0 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; {682#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 0 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} is VALID [2022-02-21 04:35:41,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 0 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); {682#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 0 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} is VALID [2022-02-21 04:35:41,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {682#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 0 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; {682#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 0 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} is VALID [2022-02-21 04:35:41,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {682#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 0 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; {695#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 1 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} is VALID [2022-02-21 04:35:41,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {695#(and (<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| 1) (<= 1 |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))} assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; {649#false} is VALID [2022-02-21 04:35:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:41,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:41,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:42,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {654#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| |ULTIMATE.start_sumOfThirdBytes_~i~0#1|)} assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; {649#false} is VALID [2022-02-21 04:35:42,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; {654#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| |ULTIMATE.start_sumOfThirdBytes_~i~0#1|)} is VALID [2022-02-21 04:35:42,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} is VALID [2022-02-21 04:35:42,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} is VALID [2022-02-21 04:35:42,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} is VALID [2022-02-21 04:35:42,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; {653#(<= |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (+ |ULTIMATE.start_sumOfThirdBytes_~i~0#1| 1))} is VALID [2022-02-21 04:35:42,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < main_~array_size~0#1); {678#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} is VALID [2022-02-21 04:35:42,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {674#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:42,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {667#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; {667#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:42,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {648#true} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; {667#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:42,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {648#true} is VALID [2022-02-21 04:35:42,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {648#true} is VALID [2022-02-21 04:35:42,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {648#true} is VALID [2022-02-21 04:35:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:42,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505533274] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:42,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:42,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 04:35:42,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919473390] [2022-02-21 04:35:42,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:42,025 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:42,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2022-02-21 04:35:42,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415639705] [2022-02-21 04:35:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,034 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:42,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 04:35:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-21 04:35:42,076 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:42,245 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-21 04:35:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:35:42,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:42,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2022-02-21 04:35:42,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:42,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 21 states and 25 transitions. [2022-02-21 04:35:42,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:35:42,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 04:35:42,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2022-02-21 04:35:42,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:42,266 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-21 04:35:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2022-02-21 04:35:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-02-21 04:35:42,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:42,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,267 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,267 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,267 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:42,268 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 04:35:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 04:35:42,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:42,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:42,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 25 transitions. [2022-02-21 04:35:42,268 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 25 transitions. [2022-02-21 04:35:42,269 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:42,270 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 04:35:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 04:35:42,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:42,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:42,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:42,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-02-21 04:35:42,271 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-21 04:35:42,271 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-21 04:35:42,271 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:42,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2022-02-21 04:35:42,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:42,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:42,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:42,272 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:42,272 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:42,272 INFO L791 eck$LassoCheckResult]: Stem: 779#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 780#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 787#L529 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 788#L529-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 774#L534-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 775#L534-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 776#L534-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 777#L534-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 778#L534-3 assume !(main_~i~1#1 < main_~array_size~0#1); 791#L534-4 assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~post4#1, sumOfThirdBytes_#t~mem5#1, sumOfThirdBytes_#t~post6#1, sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; 789#L517-3 assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; 786#L520-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 793#L520-1 assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; 792#L517-2 sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; 790#L517-3 assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset; 781#L520-3 [2022-02-21 04:35:42,272 INFO L793 eck$LassoCheckResult]: Loop: 781#L520-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 782#L520-1 assume !!(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1;sumOfThirdBytes_#t~post4#1 := sumOfThirdBytes_~sum~0#1;sumOfThirdBytes_~sum~0#1 := 1 + sumOfThirdBytes_#t~post4#1;havoc sumOfThirdBytes_#t~post4#1;call sumOfThirdBytes_#t~mem5#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);sumOfThirdBytes_#t~post6#1 := sumOfThirdBytes_#t~mem5#1;call write~int(sumOfThirdBytes_#t~post6#1 - 1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);havoc sumOfThirdBytes_#t~mem5#1;havoc sumOfThirdBytes_#t~post6#1; 781#L520-3 [2022-02-21 04:35:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2022-02-21 04:35:42,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471180451] [2022-02-21 04:35:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,301 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2022-02-21 04:35:42,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532283827] [2022-02-21 04:35:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,315 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,317 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2022-02-21 04:35:42,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58414158] [2022-02-21 04:35:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,382 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,881 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:42,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:42,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:42,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:42,881 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:42,881 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:42,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:42,881 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:42,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration6_Lasso [2022-02-21 04:35:42,882 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:42,882 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:42,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,083 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~#numbers#1.base) (+ (* ULTIMATE.start_sumOfThirdBytes_~i~0#1 4) (- 2) ULTIMATE.start_sumOfThirdBytes_~#numbers#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:35:43,087 INFO L158 Benchmark]: Toolchain (without parser) took 8287.39ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 62.8MB in the beginning and 85.2MB in the end (delta: -22.4MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,087 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:43,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.57ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 62.6MB in the beginning and 76.5MB in the end (delta: -13.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.18ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,088 INFO L158 Benchmark]: Boogie Preprocessor took 61.76ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 73.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,088 INFO L158 Benchmark]: RCFGBuilder took 309.90ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 60.9MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,088 INFO L158 Benchmark]: BuchiAutomizer took 7457.71ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 60.8MB in the beginning and 85.2MB in the end (delta: -24.4MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,089 INFO L339 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.17ms. Allocated memory is still 90.2MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.57ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 62.6MB in the beginning and 76.5MB in the end (delta: -13.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.18ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.76ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 73.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 309.90ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 60.9MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7457.71ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 60.8MB in the beginning and 85.2MB in the end (delta: -24.4MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~#numbers#1.base) (+ (* ULTIMATE.start_sumOfThirdBytes_~i~0#1 4) (- 2) ULTIMATE.start_sumOfThirdBytes_~#numbers#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~#numbers#1.base) (+ (* ULTIMATE.start_sumOfThirdBytes_~i~0#1 4) (- 2) ULTIMATE.start_sumOfThirdBytes_~#numbers#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:35:43,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~#numbers#1.base) (+ (* ULTIMATE.start_sumOfThirdBytes_~i~0#1 4) (- 2) ULTIMATE.start_sumOfThirdBytes_~#numbers#1.offset))_1 was not added to the transformula!