./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/stroeder2-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5f124ab78fe1de31a7b2962e75db493a792ddf6096d06452ccfe4c482f36b767 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:33:28,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:33:28,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:33:28,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:33:28,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:33:28,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:33:28,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:33:28,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:33:28,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:33:28,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:33:28,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:33:28,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:33:28,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:33:28,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:33:28,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:33:28,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:33:28,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:33:28,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:33:28,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:33:28,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:33:28,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:33:28,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:33:28,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:33:28,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:33:28,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:33:28,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:33:28,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:33:28,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:33:28,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:33:28,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:33:28,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:33:28,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:33:28,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:33:28,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:33:28,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:33:28,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:33:28,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:33:28,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:33:28,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:33:28,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:33:28,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:33:28,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:33:29,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:33:29,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:33:29,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:33:29,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:33:29,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:33:29,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:33:29,014 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:33:29,014 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:33:29,014 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:33:29,015 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:33:29,015 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:33:29,015 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:33:29,015 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:33:29,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:33:29,016 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:33:29,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:33:29,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:33:29,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:33:29,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:33:29,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:33:29,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:33:29,017 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:33:29,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:33:29,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:33:29,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:33:29,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:33:29,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:33:29,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:33:29,018 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:33:29,018 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f124ab78fe1de31a7b2962e75db493a792ddf6096d06452ccfe4c482f36b767 [2022-02-21 03:33:29,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:33:29,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:33:29,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:33:29,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:33:29,315 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:33:29,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i [2022-02-21 03:33:29,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43640ba07/2289be86ad4e4f30b4631159d2d11828/FLAG1efe0fc35 [2022-02-21 03:33:29,843 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:33:29,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i [2022-02-21 03:33:29,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43640ba07/2289be86ad4e4f30b4631159d2d11828/FLAG1efe0fc35 [2022-02-21 03:33:29,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43640ba07/2289be86ad4e4f30b4631159d2d11828 [2022-02-21 03:33:29,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:33:29,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:33:29,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:29,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:33:29,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:33:29,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:29" (1/1) ... [2022-02-21 03:33:29,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdd03c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:29, skipping insertion in model container [2022-02-21 03:33:29,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:29" (1/1) ... [2022-02-21 03:33:29,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:33:29,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:33:30,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:30,151 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:33:30,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:30,198 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:33:30,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30 WrapperNode [2022-02-21 03:33:30,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:30,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:30,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:33:30,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:33:30,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,242 INFO L137 Inliner]: procedures = 111, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2022-02-21 03:33:30,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:30,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:33:30,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:33:30,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:33:30,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:33:30,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:33:30,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:33:30,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:33:30,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (1/1) ... [2022-02-21 03:33:30,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:30,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:30,331 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 03:33:30,376 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 03:33:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:33:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:33:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:33:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:33:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:33:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:33:30,462 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:33:30,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:33:30,572 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:33:30,576 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:33:30,576 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:33:30,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:30 BoogieIcfgContainer [2022-02-21 03:33:30,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:33:30,578 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:33:30,578 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:33:30,581 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:33:30,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:30,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:33:29" (1/3) ... [2022-02-21 03:33:30,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7081a1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:30, skipping insertion in model container [2022-02-21 03:33:30,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:30,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:30" (2/3) ... [2022-02-21 03:33:30,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7081a1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:30, skipping insertion in model container [2022-02-21 03:33:30,583 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:30,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:30" (3/3) ... [2022-02-21 03:33:30,584 INFO L388 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca-2.i [2022-02-21 03:33:30,615 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:33:30,616 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:33:30,616 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:33:30,616 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:33:30,616 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:33:30,616 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:33:30,616 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:33:30,616 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:33:30,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 03:33:30,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:33:30,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:30,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:30,645 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:33:30,645 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:30,645 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:33:30,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 03:33:30,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:33:30,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:30,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:30,648 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:33:30,648 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:30,653 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#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~ret9#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; 11#L564true assume !(main_~array_size~0#1 < 1); 12#L564-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;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; 5#L552-3true [2022-02-21 03:33:30,654 INFO L793 eck$LassoCheckResult]: Loop: 5#L552-3true 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; 7#L555-3true assume !true; 10#L552-2true sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; 5#L552-3true [2022-02-21 03:33:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 03:33:30,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:30,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596672703] [2022-02-21 03:33:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:30,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:30,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:30,775 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2022-02-21 03:33:30,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:30,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258581025] [2022-02-21 03:33:30,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:30,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} 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; {19#true} is VALID [2022-02-21 03:33:30,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume !true; {20#false} is VALID [2022-02-21 03:33:30,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#false} sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; {20#false} is VALID [2022-02-21 03:33:30,826 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 03:33:30,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:30,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258581025] [2022-02-21 03:33:30,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258581025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:33:30,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:33:30,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:33:30,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083666045] [2022-02-21 03:33:30,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:33:30,833 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:33:30,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:33:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:33:30,866 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 03:33:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:30,893 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 03:33:30,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:33:30,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 03:33:30,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:30,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2022-02-21 03:33:30,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:33:30,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2022-02-21 03:33:30,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:33:30,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:33:30,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2022-02-21 03:33:30,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:33:30,919 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:33:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2022-02-21 03:33:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-21 03:33:30,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:30,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 03:33:30,935 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 03:33:30,936 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 03:33:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:30,937 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2022-02-21 03:33:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:33:30,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:30,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:30,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 8 states and 10 transitions. [2022-02-21 03:33:30,938 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 8 states and 10 transitions. [2022-02-21 03:33:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:30,939 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2022-02-21 03:33:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:33:30,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:30,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:30,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:30,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 03:33:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-02-21 03:33:30,942 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:33:30,942 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:33:30,942 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:33:30,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:33:30,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:33:30,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:30,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:30,943 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:33:30,943 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:33:30,943 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#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~ret9#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; 40#L564 assume !(main_~array_size~0#1 < 1); 41#L564-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;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; 35#L552-3 [2022-02-21 03:33:30,943 INFO L793 eck$LassoCheckResult]: Loop: 35#L552-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; 38#L555-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 39#L555-1 assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; 34#L552-2 sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; 35#L552-3 [2022-02-21 03:33:30,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-02-21 03:33:30,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:30,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947224356] [2022-02-21 03:33:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:30,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:30,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:30,964 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2022-02-21 03:33:30,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:30,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762522866] [2022-02-21 03:33:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:30,982 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:30,993 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2022-02-21 03:33:30,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:30,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578017614] [2022-02-21 03:33:30,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:31,020 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:31,034 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:31,363 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:31,370 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:31,370 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:31,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:31,370 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:31,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:31,371 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:31,371 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:31,371 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration2_Lasso [2022-02-21 03:33:31,371 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:31,371 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:31,389 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 03:33:31,394 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 03:33:31,397 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 03:33:31,399 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 03:33:31,402 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 03:33:31,406 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 03:33:31,409 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 03:33:31,412 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 03:33:31,415 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 03:33:31,418 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 03:33:31,517 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 03:33:31,519 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 03:33:31,521 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 03:33:31,523 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 03:33:31,525 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 03:33:31,526 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 03:33:31,787 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:31,796 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:31,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:31,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:31,799 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 03:33:31,814 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 03:33:31,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:31,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:31,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:31,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:31,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:31,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:31,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:31,829 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 03:33:31,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:31,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:31,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:31,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:31,862 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 03:33:31,903 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 03:33:31,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:31,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:31,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:31,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:31,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:31,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:31,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:31,915 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 03:33:31,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:31,939 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 03:33:31,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:31,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:31,941 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 03:33:31,945 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 03:33:31,946 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 03:33:31,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:31,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:31,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:31,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:31,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:31,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:31,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:31,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:31,981 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 03:33:31,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:31,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:31,983 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 03:33:31,984 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 03:33:31,985 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 03:33:31,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:31,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:31,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:31,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:31,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:31,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:31,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:32,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:32,029 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 03:33:32,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:32,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:32,031 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 03:33:32,032 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 03:33:32,033 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 03:33:32,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:32,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:32,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:32,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:32,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:32,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:32,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:32,093 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 03:33:32,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:32,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:32,095 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 03:33:32,096 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 03:33:32,098 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 03:33:32,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:32,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:32,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:32,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:32,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:32,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:32,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:32,142 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 03:33:32,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:32,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:32,144 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 03:33:32,155 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 03:33:32,155 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 03:33:32,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:32,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:32,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:32,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:32,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:32,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:32,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:32,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:32,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:33:32,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:32,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:32,193 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 03:33:32,195 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 03:33:32,201 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 03:33:32,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:32,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:32,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:32,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:32,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:32,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:32,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:32,242 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 03:33:32,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:32,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:32,243 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 03:33:32,254 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 03:33:32,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:32,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:32,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:32,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:32,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:32,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:32,267 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 03:33:32,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:32,288 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 03:33:32,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:32,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:32,290 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 03:33:32,298 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 03:33:32,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:32,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:32,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:32,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:32,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:32,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:32,310 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 03:33:32,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:32,329 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 03:33:32,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:32,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:32,331 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 03:33:32,331 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 03:33:32,333 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 03:33:32,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:32,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:32,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:32,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:32,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:32,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:32,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:32,400 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-02-21 03:33:32,400 INFO L444 ModelExtractionUtils]: 15 out of 37 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-02-21 03:33:32,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:32,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:32,402 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 03:33:32,404 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 03:33:32,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:32,437 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:33:32,437 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:32,438 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1) = -4*ULTIMATE.start_sumOfThirdBytes_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1 Supporting invariants [-4*ULTIMATE.start_sumOfThirdBytes_~array_size#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1 >= 0] [2022-02-21 03:33:32,467 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 03:33:32,483 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:33:32,504 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 03:33:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:32,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:32,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:33:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:32,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:32,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {67#unseeded} is VALID [2022-02-21 03:33:32,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#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~ret9#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; {67#unseeded} is VALID [2022-02-21 03:33:32,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#unseeded} assume !(main_~array_size~0#1 < 1); {67#unseeded} is VALID [2022-02-21 03:33:32,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#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;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; {91#(and unseeded (>= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* (- 4) |ULTIMATE.start_sumOfThirdBytes_~array_size#1|)) 0))} is VALID [2022-02-21 03:33:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:32,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:33:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:32,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:32,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|))) (>= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* (- 4) |ULTIMATE.start_sumOfThirdBytes_~array_size#1|)) 0))} 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; {109#(and (>= (+ (* |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (- 4)) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|)) 0) (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* |ULTIMATE.start_sumOfThirdBytes_~i~0#1| (- 4)))))} is VALID [2022-02-21 03:33:32,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#(and (>= (+ (* |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (- 4)) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|)) 0) (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* |ULTIMATE.start_sumOfThirdBytes_~i~0#1| (- 4)))))} call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); {109#(and (>= (+ (* |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (- 4)) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|)) 0) (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* |ULTIMATE.start_sumOfThirdBytes_~i~0#1| (- 4)))))} is VALID [2022-02-21 03:33:32,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#(and (>= (+ (* |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (- 4)) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|)) 0) (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* |ULTIMATE.start_sumOfThirdBytes_~i~0#1| (- 4)))))} assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; {109#(and (>= (+ (* |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (- 4)) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|)) 0) (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* |ULTIMATE.start_sumOfThirdBytes_~i~0#1| (- 4)))))} is VALID [2022-02-21 03:33:32,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#(and (>= (+ (* |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (- 4)) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|)) 0) (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* |ULTIMATE.start_sumOfThirdBytes_~i~0#1| (- 4)))))} sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; {94#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|))))) (>= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* (- 4) |ULTIMATE.start_sumOfThirdBytes_~array_size#1|)) 0))} is VALID [2022-02-21 03:33:32,650 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 03:33:32,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:32,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,662 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 03:33:32,663 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,713 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 13 states and 17 transitions. Complement of second has 4 states. [2022-02-21 03:33:32,714 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 03:33:32,714 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:32,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 3 [2022-02-21 03:33:32,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:32,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:32,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:32,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:32,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:32,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:33:32,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:32,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:32,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:32,719 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 3 [2022-02-21 03:33:32,728 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:33:32,745 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:32,746 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:32,746 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:32,746 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:33:32,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:32,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:32,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:32,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:32,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:32,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 2 letters. [2022-02-21 03:33:32,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:32,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:33:32,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 13 letters. [2022-02-21 03:33:32,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:33:32,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:33:32,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 letters. [2022-02-21 03:33:32,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:33:32,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:32,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:32,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:33:32,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 4 letters. [2022-02-21 03:33:32,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:33:32,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:32,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:32,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:32,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:32,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:32,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 2 letters. [2022-02-21 03:33:32,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:32,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:32,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:32,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:32,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 2 letters. [2022-02-21 03:33:32,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:32,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:32,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:32,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,761 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:33:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:33:32,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:32,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:33:32,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2022-02-21 03:33:32,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:32,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:32,766 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 03:33:32,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:32,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2022-02-21 03:33:32,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:33:32,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:33:32,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 03:33:32,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:32,769 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:33:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 03:33:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-02-21 03:33:32,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:32,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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 03:33:32,770 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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 03:33:32,771 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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 03:33:32,771 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:32,775 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:33:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:33:32,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:32,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:32,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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 12 states and 16 transitions. [2022-02-21 03:33:32,776 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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 12 states and 16 transitions. [2022-02-21 03:33:32,777 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:32,780 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:33:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:33:32,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:32,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:32,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:32,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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 03:33:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-02-21 03:33:32,782 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:33:32,782 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:33:32,782 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:33:32,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:33:32,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:32,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:32,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:32,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:33:32,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:33:32,786 INFO L791 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 142#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~ret9#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; 148#L564 assume !(main_~array_size~0#1 < 1); 149#L564-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;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; 143#L552-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; 145#L555-3 [2022-02-21 03:33:32,786 INFO L793 eck$LassoCheckResult]: Loop: 145#L555-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 146#L555-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; 145#L555-3 [2022-02-21 03:33:32,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2022-02-21 03:33:32,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:32,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714410912] [2022-02-21 03:33:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:32,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:32,815 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:32,829 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2022-02-21 03:33:32,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:32,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986268844] [2022-02-21 03:33:32,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:32,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:32,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:32,853 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2022-02-21 03:33:32,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:32,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497087161] [2022-02-21 03:33:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:32,876 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:32,898 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:33,111 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:33,111 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:33,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:33,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:33,112 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:33,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:33,112 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:33,112 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:33,112 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration3_Lasso [2022-02-21 03:33:33,112 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:33,112 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:33,114 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 03:33:33,116 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 03:33:33,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 03:33:33,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 03:33:33,122 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 03:33:33,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 03:33:33,126 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 03:33:33,129 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 03:33:33,131 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 03:33:33,299 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 03:33:33,301 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 03:33:33,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 03:33:33,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 03:33:33,307 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 03:33:33,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 03:33:33,311 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 03:33:33,590 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:33,590 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:33,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:33,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:33,608 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 03:33:33,622 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 03:33:33,624 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 03:33:33,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:33,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:33,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:33,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:33,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:33,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:33,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:33,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:33,648 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 03:33:33,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:33,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:33,664 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 03:33:33,665 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 03:33:33,667 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 03:33:33,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:33,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:33,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:33,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:33,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:33,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:33,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:33,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:33,717 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 03:33:33,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:33,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:33,736 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 03:33:33,738 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 03:33:33,740 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 03:33:33,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:33,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:33,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:33,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:33,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:33,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:33,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:33,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:33,777 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 03:33:33,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:33,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:33,779 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 03:33:33,779 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 03:33:33,781 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 03:33:33,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:33,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:33,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:33,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:33,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:33,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:33,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:33,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:33,806 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 03:33:33,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:33,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:33,808 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 03:33:33,808 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 03:33:33,810 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 03:33:33,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:33,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:33,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:33,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:33,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:33,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:33,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:33,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:33,837 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 03:33:33,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:33,839 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 03:33:33,841 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 03:33:33,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 03:33:33,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:33,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:33,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:33,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:33,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:33,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:33,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:33,889 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 03:33:33,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:33,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:33,890 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 03:33:33,896 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 03:33:33,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:33,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:33,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:33,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:33,902 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 03:33:33,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:33,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:33,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:33,953 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 03:33:33,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:33,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:33,955 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 03:33:33,963 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 03:33:33,963 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 03:33:33,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:33,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:33,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:33,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:33,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:33,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:33,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:34,007 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 03:33:34,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:34,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:34,024 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 03:33:34,039 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 03:33:34,040 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 03:33:34,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:34,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:34,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:34,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:34,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:34,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:34,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:34,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:34,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:34,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:34,098 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 03:33:34,099 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 03:33:34,100 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 03:33:34,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:34,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:34,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:34,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:34,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:34,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:34,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:34,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:34,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:34,150 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 03:33:34,151 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 03:33:34,152 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 03:33:34,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:34,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:34,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:34,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:34,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:34,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:34,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:34,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:34,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:34,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:34,199 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 03:33:34,200 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 03:33:34,201 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 03:33:34,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:34,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:34,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:34,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:34,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:34,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:34,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:34,209 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:34,211 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:33:34,211 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:33:34,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:34,212 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 03:33:34,213 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 03:33:34,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:34,214 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:33:34,214 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:34,214 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 03:33:34,232 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 03:33:34,256 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 03:33:34,271 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:33:34,274 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 03:33:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:34,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:33:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:34,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:34,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {217#unseeded} is VALID [2022-02-21 03:33:34,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#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~ret9#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; {217#unseeded} is VALID [2022-02-21 03:33:34,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#unseeded} assume !(main_~array_size~0#1 < 1); {217#unseeded} is VALID [2022-02-21 03:33:34,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {217#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;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; {217#unseeded} is VALID [2022-02-21 03:33:34,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {217#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; {217#unseeded} is VALID [2022-02-21 03:33:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:34,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:33:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:34,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:34,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {220#(>= 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); {262#(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 03:33:34,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#(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; {245#(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 03:33:34,342 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 03:33:34,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:34,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,348 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 03:33:34,349 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 22 states and 29 transitions. Complement of second has 7 states. [2022-02-21 03:33:34,375 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 03:33:34,375 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:34,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:34,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:34,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:34,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:34,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:34,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:34,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2022-02-21 03:33:34,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:34,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:34,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:34,377 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 15 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:34,378 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:33:34,378 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:34,378 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:34,379 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 29 transitions. cyclomatic complexity: 11 [2022-02-21 03:33:34,379 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:33:34,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:34,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:34,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:34,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:34,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:33:34,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:33:34,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:33:34,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 22 letters. Loop has 22 letters. [2022-02-21 03:33:34,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:33:34,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:33:34,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 11 letters. [2022-02-21 03:33:34,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:33:34,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:34,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:34,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:34,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:34,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:34,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:33:34,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:34,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:34,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:34,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:33:34,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:33:34,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:34,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:34,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,387 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:33:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-21 03:33:34,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:34,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:34,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:33:34,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:34,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. cyclomatic complexity: 11 [2022-02-21 03:33:34,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:34,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2022-02-21 03:33:34,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:33:34,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:33:34,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2022-02-21 03:33:34,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:34,390 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:33:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2022-02-21 03:33:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2022-02-21 03:33:34,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:34,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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 03:33:34,392 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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 03:33:34,392 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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 03:33:34,392 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:34,393 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2022-02-21 03:33:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:33:34,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:34,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:34,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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 03:33:34,393 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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 03:33:34,394 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:34,395 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2022-02-21 03:33:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:33:34,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:34,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:34,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:34,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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 03:33:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2022-02-21 03:33:34,396 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-02-21 03:33:34,396 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-02-21 03:33:34,396 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:33:34,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2022-02-21 03:33:34,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:34,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:34,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:34,397 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:34,397 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:33:34,397 INFO L791 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 305#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~ret9#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; 308#L564 assume !(main_~array_size~0#1 < 1); 309#L564-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;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; 300#L552-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; 301#L555-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 311#L555-1 assume !(sumOfThirdBytes_#t~mem3#1 > 0);havoc sumOfThirdBytes_#t~mem3#1; 298#L552-2 sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; 299#L552-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; 303#L555-3 [2022-02-21 03:33:34,397 INFO L793 eck$LassoCheckResult]: Loop: 303#L555-3 call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1); 306#L555-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; 303#L555-3 [2022-02-21 03:33:34,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2022-02-21 03:33:34,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:34,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64786034] [2022-02-21 03:33:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:34,409 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:34,416 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:34,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2022-02-21 03:33:34,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:34,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691858232] [2022-02-21 03:33:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:34,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:34,425 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:34,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2022-02-21 03:33:34,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:34,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003043185] [2022-02-21 03:33:34,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:34,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:34,438 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:34,448 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:34,669 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:34,670 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:34,670 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:34,670 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:34,670 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:34,670 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:34,670 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:34,670 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:34,670 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration4_Lasso [2022-02-21 03:33:34,670 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:34,670 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:34,672 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 03:33:34,675 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 03:33:34,677 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 03:33:34,803 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) (+ (- 2) (* ULTIMATE.start_sumOfThirdBytes_~i~0#1 4) 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 03:33:34,806 INFO L158 Benchmark]: Toolchain (without parser) took 4940.94ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 61.3MB in the beginning and 76.5MB in the end (delta: -15.2MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2022-02-21 03:33:34,807 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:34,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.68ms. Allocated memory is still 96.5MB. Free memory was 61.1MB in the beginning and 65.4MB in the end (delta: -4.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:33:34,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.47ms. Allocated memory is still 96.5MB. Free memory was 65.4MB in the beginning and 63.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:34,807 INFO L158 Benchmark]: Boogie Preprocessor took 41.35ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 62.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:34,808 INFO L158 Benchmark]: RCFGBuilder took 286.18ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 51.2MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:33:34,808 INFO L158 Benchmark]: BuchiAutomizer took 4227.19ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 50.7MB in the beginning and 76.5MB in the end (delta: -25.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-02-21 03:33:34,809 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.19ms. Allocated memory is still 77.6MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.68ms. Allocated memory is still 96.5MB. Free memory was 61.1MB in the beginning and 65.4MB in the end (delta: -4.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.47ms. Allocated memory is still 96.5MB. Free memory was 65.4MB in the beginning and 63.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.35ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 62.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 286.18ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 51.2MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4227.19ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 50.7MB in the beginning and 76.5MB in the end (delta: -25.7MB). Peak memory consumption was 41.9MB. 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) (+ (- 2) (* ULTIMATE.start_sumOfThirdBytes_~i~0#1 4) 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) (+ (- 2) (* ULTIMATE.start_sumOfThirdBytes_~i~0#1 4) 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 03:33:34,853 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*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_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) (+ (- 2) (* ULTIMATE.start_sumOfThirdBytes_~i~0#1 4) ULTIMATE.start_sumOfThirdBytes_~#numbers#1.offset))_1 was not added to the transformula!