./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.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/Toulouse-MultiBranchesToLoop-alloca.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 d2e8c7278f9710711a8ba5cefeb9f745a5377c275c5c72390d2d78403afcf1c7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:31:02,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:31:02,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:31:02,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:31:02,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:31:02,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:31:02,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:31:02,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:31:02,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:31:02,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:31:02,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:31:02,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:31:02,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:31:02,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:31:02,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:31:02,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:31:02,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:31:02,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:31:02,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:31:02,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:31:02,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:31:02,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:31:02,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:31:02,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:31:02,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:31:02,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:31:02,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:31:02,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:31:02,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:31:02,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:31:02,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:31:02,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:31:02,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:31:02,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:31:02,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:31:02,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:31:02,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:31:02,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:31:02,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:31:02,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:31:02,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:31:02,396 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:31:02,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:31:02,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:31:02,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:31:02,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:31:02,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:31:02,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:31:02,432 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:31:02,432 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:31:02,433 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:31:02,433 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:31:02,434 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:31:02,434 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:31:02,434 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:31:02,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:31:02,434 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:31:02,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:31:02,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:31:02,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:31:02,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:31:02,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:31:02,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:31:02,436 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:31:02,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:31:02,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:31:02,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:31:02,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:31:02,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:31:02,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:31:02,438 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:31:02,438 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 -> d2e8c7278f9710711a8ba5cefeb9f745a5377c275c5c72390d2d78403afcf1c7 [2022-02-21 03:31:02,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:31:02,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:31:02,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:31:02,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:31:02,694 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:31:02,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2022-02-21 03:31:02,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ce87dc1/3384d48887de42b1bc690524d428ad35/FLAG95f7485d0 [2022-02-21 03:31:03,250 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:31:03,251 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2022-02-21 03:31:03,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ce87dc1/3384d48887de42b1bc690524d428ad35/FLAG95f7485d0 [2022-02-21 03:31:03,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ce87dc1/3384d48887de42b1bc690524d428ad35 [2022-02-21 03:31:03,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:31:03,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:31:03,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:31:03,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:31:03,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:31:03,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:31:03" (1/1) ... [2022-02-21 03:31:03,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670bba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:03, skipping insertion in model container [2022-02-21 03:31:03,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:31:03" (1/1) ... [2022-02-21 03:31:03,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:31:03,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:31:04,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:31:04,018 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:31:04,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:31:04,108 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:31:04,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04 WrapperNode [2022-02-21 03:31:04,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:31:04,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:31:04,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:31:04,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:31:04,117 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:31:04" (1/1) ... [2022-02-21 03:31:04,147 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:31:04" (1/1) ... [2022-02-21 03:31:04,176 INFO L137 Inliner]: procedures = 110, calls = 67, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2022-02-21 03:31:04,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:31:04,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:31:04,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:31:04,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:31:04,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04" (1/1) ... [2022-02-21 03:31:04,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04" (1/1) ... [2022-02-21 03:31:04,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04" (1/1) ... [2022-02-21 03:31:04,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04" (1/1) ... [2022-02-21 03:31:04,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04" (1/1) ... [2022-02-21 03:31:04,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04" (1/1) ... [2022-02-21 03:31:04,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04" (1/1) ... [2022-02-21 03:31:04,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:31:04,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:31:04,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:31:04,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:31:04,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04" (1/1) ... [2022-02-21 03:31:04,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:04,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:04,264 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:31:04,282 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:31:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:31:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:31:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:31:04,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:31:04,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:31:04,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:31:04,420 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:31:04,422 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:31:04,860 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:31:04,865 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:31:04,865 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:31:04,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:04 BoogieIcfgContainer [2022-02-21 03:31:04,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:31:04,867 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:31:04,868 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:31:04,871 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:31:04,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:04,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:31:03" (1/3) ... [2022-02-21 03:31:04,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f68ea4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:31:04, skipping insertion in model container [2022-02-21 03:31:04,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:04,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:04" (2/3) ... [2022-02-21 03:31:04,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f68ea4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:31:04, skipping insertion in model container [2022-02-21 03:31:04,874 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:04,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:04" (3/3) ... [2022-02-21 03:31:04,875 INFO L388 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2022-02-21 03:31:04,910 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:31:04,910 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:31:04,910 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:31:04,910 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:31:04,911 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:31:04,911 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:31:04,911 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:31:04,911 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:31:04,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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:31:04,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:04,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:04,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:04,958 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:04,958 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:04,958 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:31:04,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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:31:04,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:04,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:04,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:04,974 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:04,974 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:04,979 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 10#L553true assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 4#L553-2true call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 23#L558true assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 19#L558-2true call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 24#L563true assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 20#L563-2true call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 27#L568true assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 26#L568-2true call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 15#L573true assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 8#L573-2true call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 12#L578true assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 16#L578-2true call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 21#L583true assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 25#L583-2true call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 18#L588true assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 7#L588-2true call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 9#L593true assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 17#L598-4true [2022-02-21 03:31:04,979 INFO L793 eck$LassoCheckResult]: Loop: 17#L598-4true call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 13#L598true assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 22#L598-2true assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 17#L598-4true [2022-02-21 03:31:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2022-02-21 03:31:04,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:04,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600340222] [2022-02-21 03:31:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:05,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {30#true} is VALID [2022-02-21 03:31:05,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {30#true} is VALID [2022-02-21 03:31:05,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); {32#(= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:05,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#(= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {33#(and (= (+ |ULTIMATE.start_main_#t~mem8#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0))} is VALID [2022-02-21 03:31:05,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#(and (= (+ |ULTIMATE.start_main_#t~mem8#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0))} assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; {34#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:05,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {35#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem13#1|) 0))} is VALID [2022-02-21 03:31:05,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem13#1|) 0))} assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; {36#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:05,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {37#(and (<= (+ 3 |ULTIMATE.start_main_#t~mem18#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:05,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#(and (<= (+ 3 |ULTIMATE.start_main_#t~mem18#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; {38#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:05,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {38#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:05,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; {39#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:05,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {39#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:05,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {40#(<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:05,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#(<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {41#(<= (+ 6 |ULTIMATE.start_main_#t~mem33#1|) 0)} is VALID [2022-02-21 03:31:05,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#(<= (+ 6 |ULTIMATE.start_main_#t~mem33#1|) 0)} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {31#false} is VALID [2022-02-21 03:31:05,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {31#false} is VALID [2022-02-21 03:31:05,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; {31#false} is VALID [2022-02-21 03:31:05,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {31#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {31#false} is VALID [2022-02-21 03:31:05,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {31#false} assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; {31#false} is VALID [2022-02-21 03:31:05,535 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:31:05,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:05,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600340222] [2022-02-21 03:31:05,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600340222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:05,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:05,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-21 03:31:05,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922424040] [2022-02-21 03:31:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:05,542 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2022-02-21 03:31:05,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:05,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917496992] [2022-02-21 03:31:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:05,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:05,638 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:05,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:05,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:31:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:31:05,957 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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:31:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:07,141 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-02-21 03:31:07,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:31:07,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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:31:07,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:07,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 112 transitions. [2022-02-21 03:31:07,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:07,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 66 states and 92 transitions. [2022-02-21 03:31:07,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-02-21 03:31:07,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-02-21 03:31:07,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2022-02-21 03:31:07,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:07,180 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-02-21 03:31:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2022-02-21 03:31:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 34. [2022-02-21 03:31:07,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:07,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states and 92 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:31:07,201 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states and 92 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:31:07,202 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:31:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:07,205 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2022-02-21 03:31:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2022-02-21 03:31:07,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:07,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:07,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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 66 states and 92 transitions. [2022-02-21 03:31:07,208 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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 66 states and 92 transitions. [2022-02-21 03:31:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:07,211 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2022-02-21 03:31:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2022-02-21 03:31:07,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:07,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:07,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:07,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:31:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-02-21 03:31:07,215 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-02-21 03:31:07,215 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-02-21 03:31:07,216 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:31:07,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2022-02-21 03:31:07,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:07,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:07,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:07,217 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:07,218 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:07,218 INFO L791 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 146#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 151#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 155#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 144#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 145#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 147#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 148#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 162#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 134#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 135#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 150#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 136#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 137#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 153#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 142#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 143#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 149#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 138#L598-4 [2022-02-21 03:31:07,218 INFO L793 eck$LassoCheckResult]: Loop: 138#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 139#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 154#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 138#L598-4 [2022-02-21 03:31:07,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1775784008, now seen corresponding path program 1 times [2022-02-21 03:31:07,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:07,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572054072] [2022-02-21 03:31:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:07,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:07,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {301#true} is VALID [2022-02-21 03:31:07,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {301#true} is VALID [2022-02-21 03:31:07,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); {303#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1)} is VALID [2022-02-21 03:31:07,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {303#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1)} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {304#(= (+ (- 1) |ULTIMATE.start_main_#t~mem8#1|) 0)} is VALID [2022-02-21 03:31:07,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {304#(= (+ (- 1) |ULTIMATE.start_main_#t~mem8#1|) 0)} assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; {302#false} is VALID [2022-02-21 03:31:07,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#false} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {302#false} is VALID [2022-02-21 03:31:07,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#false} assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; {302#false} is VALID [2022-02-21 03:31:07,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {302#false} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {302#false} is VALID [2022-02-21 03:31:07,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {302#false} assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; {302#false} is VALID [2022-02-21 03:31:07,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#false} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {302#false} is VALID [2022-02-21 03:31:07,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {302#false} assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; {302#false} is VALID [2022-02-21 03:31:07,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#false} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {302#false} is VALID [2022-02-21 03:31:07,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#false} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {302#false} is VALID [2022-02-21 03:31:07,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {302#false} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {302#false} is VALID [2022-02-21 03:31:07,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {302#false} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {302#false} is VALID [2022-02-21 03:31:07,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {302#false} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {302#false} is VALID [2022-02-21 03:31:07,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; {302#false} is VALID [2022-02-21 03:31:07,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {302#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {302#false} is VALID [2022-02-21 03:31:07,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {302#false} assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; {302#false} is VALID [2022-02-21 03:31:07,290 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:31:07,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:07,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572054072] [2022-02-21 03:31:07,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572054072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:07,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:07,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:31:07,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443019309] [2022-02-21 03:31:07,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:07,292 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2022-02-21 03:31:07,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:07,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462999170] [2022-02-21 03:31:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:07,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:07,327 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:07,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:07,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:31:07,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:31:07,532 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:31:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:07,637 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-21 03:31:07,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:31:07,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:31:07,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:07,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2022-02-21 03:31:07,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:07,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 45 transitions. [2022-02-21 03:31:07,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-02-21 03:31:07,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-02-21 03:31:07,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 45 transitions. [2022-02-21 03:31:07,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:07,658 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-21 03:31:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 45 transitions. [2022-02-21 03:31:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-21 03:31:07,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:07,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 45 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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:31:07,661 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 45 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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:31:07,662 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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:31:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:07,663 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-21 03:31:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-21 03:31:07,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:07,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:07,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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 34 states and 45 transitions. [2022-02-21 03:31:07,664 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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 34 states and 45 transitions. [2022-02-21 03:31:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:07,666 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-21 03:31:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-21 03:31:07,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:07,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:07,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:07,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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:31:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-21 03:31:07,672 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-21 03:31:07,672 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-21 03:31:07,672 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:31:07,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-02-21 03:31:07,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:07,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:07,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:07,673 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:07,674 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:07,674 INFO L791 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 344#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 360#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 363#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 376#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 375#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 374#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 372#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 370#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 371#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 373#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 346#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 369#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 366#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 368#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 364#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 352#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 353#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 361#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 350#L598-4 [2022-02-21 03:31:07,675 INFO L793 eck$LassoCheckResult]: Loop: 350#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 351#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 365#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 350#L598-4 [2022-02-21 03:31:07,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:07,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1239319610, now seen corresponding path program 1 times [2022-02-21 03:31:07,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:07,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530212628] [2022-02-21 03:31:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:07,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {448#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {448#true} is VALID [2022-02-21 03:31:07,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {448#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {448#true} is VALID [2022-02-21 03:31:07,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {448#true} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); {448#true} is VALID [2022-02-21 03:31:07,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {448#true} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {450#(= (+ |ULTIMATE.start_main_#t~mem8#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0)} is VALID [2022-02-21 03:31:07,804 INFO L290 TraceCheckUtils]: 4: Hoare triple {450#(= (+ |ULTIMATE.start_main_#t~mem8#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0)} assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; {451#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:07,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {452#(<= 2 |ULTIMATE.start_main_#t~mem13#1|)} is VALID [2022-02-21 03:31:07,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(<= 2 |ULTIMATE.start_main_#t~mem13#1|)} assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; {449#false} is VALID [2022-02-21 03:31:07,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {449#false} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {449#false} is VALID [2022-02-21 03:31:07,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#false} assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; {453#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:07,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {453#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {453#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:07,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {453#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; {454#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:07,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {454#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {454#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:07,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {455#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:07,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {456#(and (<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem33#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:07,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(and (<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem33#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {449#false} is VALID [2022-02-21 03:31:07,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {449#false} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {449#false} is VALID [2022-02-21 03:31:07,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {449#false} assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; {449#false} is VALID [2022-02-21 03:31:07,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {449#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {449#false} is VALID [2022-02-21 03:31:07,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {449#false} assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; {449#false} is VALID [2022-02-21 03:31:07,823 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:31:07,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:07,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530212628] [2022-02-21 03:31:07,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530212628] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:07,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:07,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 03:31:07,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582988410] [2022-02-21 03:31:07,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:07,825 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2022-02-21 03:31:07,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:07,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779177690] [2022-02-21 03:31:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:07,844 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:07,857 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:08,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:08,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:31:08,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:31:08,063 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 12 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:31:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:08,507 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-02-21 03:31:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:31:08,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:31:08,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:08,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2022-02-21 03:31:08,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:08,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2022-02-21 03:31:08,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-02-21 03:31:08,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-02-21 03:31:08,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2022-02-21 03:31:08,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:08,532 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2022-02-21 03:31:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2022-02-21 03:31:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-02-21 03:31:08,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:08,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states and 63 transitions. Second operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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:31:08,534 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states and 63 transitions. Second operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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:31:08,535 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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:31:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:08,536 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-02-21 03:31:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-02-21 03:31:08,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:08,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:08,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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 47 states and 63 transitions. [2022-02-21 03:31:08,537 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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 47 states and 63 transitions. [2022-02-21 03:31:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:08,539 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-02-21 03:31:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-02-21 03:31:08,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:08,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:08,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:08,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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:31:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-02-21 03:31:08,541 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-21 03:31:08,541 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-21 03:31:08,542 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:31:08,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2022-02-21 03:31:08,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:08,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:08,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:08,543 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:08,543 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:08,543 INFO L791 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 522#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 516#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 517#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 538#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 536#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 523#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 524#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 534#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 510#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 511#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 526#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 532#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 535#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 528#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 518#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 519#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 525#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 514#L598-4 [2022-02-21 03:31:08,544 INFO L793 eck$LassoCheckResult]: Loop: 514#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 515#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 529#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 514#L598-4 [2022-02-21 03:31:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash -652513596, now seen corresponding path program 1 times [2022-02-21 03:31:08,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:08,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77233018] [2022-02-21 03:31:08,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:08,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {639#true} is VALID [2022-02-21 03:31:08,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {639#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {639#true} is VALID [2022-02-21 03:31:08,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {639#true} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); {639#true} is VALID [2022-02-21 03:31:08,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {639#true} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {639#true} is VALID [2022-02-21 03:31:08,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {639#true} assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; {639#true} is VALID [2022-02-21 03:31:08,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {639#true} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {641#(= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0)} is VALID [2022-02-21 03:31:08,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#(= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0)} assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; {642#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:08,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {643#(and (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (<= 2 |ULTIMATE.start_main_#t~mem18#1|))} is VALID [2022-02-21 03:31:08,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {643#(and (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (<= 2 |ULTIMATE.start_main_#t~mem18#1|))} assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; {644#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:08,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {644#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {644#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:08,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {644#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; {645#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:08,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {645#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {645#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:08,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {645#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {646#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:08,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {647#(and (<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem33#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:08,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {647#(and (<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem33#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {640#false} is VALID [2022-02-21 03:31:08,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#false} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {640#false} is VALID [2022-02-21 03:31:08,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {640#false} assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; {640#false} is VALID [2022-02-21 03:31:08,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {640#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {640#false} is VALID [2022-02-21 03:31:08,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {640#false} assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; {640#false} is VALID [2022-02-21 03:31:08,694 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:31:08,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:08,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77233018] [2022-02-21 03:31:08,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77233018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:08,695 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:08,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 03:31:08,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310120263] [2022-02-21 03:31:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:08,696 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2022-02-21 03:31:08,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:08,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197892354] [2022-02-21 03:31:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:08,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:08,735 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:08,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:08,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:31:08,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:31:08,943 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:31:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:09,305 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-21 03:31:09,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:31:09,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:31:09,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:09,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2022-02-21 03:31:09,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:09,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2022-02-21 03:31:09,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-02-21 03:31:09,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-02-21 03:31:09,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2022-02-21 03:31:09,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:09,327 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-02-21 03:31:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2022-02-21 03:31:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-02-21 03:31:09,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:09,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 59 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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:31:09,330 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 59 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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:31:09,330 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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:31:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:09,332 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-21 03:31:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-02-21 03:31:09,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:09,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:09,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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 45 states and 59 transitions. [2022-02-21 03:31:09,333 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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 45 states and 59 transitions. [2022-02-21 03:31:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:09,334 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-21 03:31:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-02-21 03:31:09,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:09,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:09,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:09,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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:31:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-02-21 03:31:09,337 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 03:31:09,337 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 03:31:09,337 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:31:09,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-02-21 03:31:09,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:09,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:09,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:09,338 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:09,338 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:09,338 INFO L791 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 696#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 710#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 715#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 726#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 708#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 709#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 711#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 712#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 720#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 721#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 698#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 723#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 719#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 722#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 716#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 706#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 707#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 713#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 702#L598-4 [2022-02-21 03:31:09,339 INFO L793 eck$LassoCheckResult]: Loop: 702#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 703#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 717#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 702#L598-4 [2022-02-21 03:31:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1353578174, now seen corresponding path program 1 times [2022-02-21 03:31:09,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:09,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238093608] [2022-02-21 03:31:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:09,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {822#true} is VALID [2022-02-21 03:31:09,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {822#true} is VALID [2022-02-21 03:31:09,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); {822#true} is VALID [2022-02-21 03:31:09,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {822#true} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {822#true} is VALID [2022-02-21 03:31:09,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {822#true} assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; {822#true} is VALID [2022-02-21 03:31:09,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {822#true} is VALID [2022-02-21 03:31:09,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#true} assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; {822#true} is VALID [2022-02-21 03:31:09,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {824#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:09,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {824#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; {825#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:09,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {825#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {826#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem23#1|) 0) (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:09,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {826#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem23#1|) 0) (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; {823#false} is VALID [2022-02-21 03:31:09,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#false} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {823#false} is VALID [2022-02-21 03:31:09,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {823#false} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {827#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:09,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {827#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {828#(<= (+ 3 |ULTIMATE.start_main_#t~mem33#1|) 0)} is VALID [2022-02-21 03:31:09,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#(<= (+ 3 |ULTIMATE.start_main_#t~mem33#1|) 0)} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {823#false} is VALID [2022-02-21 03:31:09,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {823#false} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {823#false} is VALID [2022-02-21 03:31:09,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {823#false} assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; {823#false} is VALID [2022-02-21 03:31:09,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {823#false} is VALID [2022-02-21 03:31:09,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#false} assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; {823#false} is VALID [2022-02-21 03:31:09,451 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:31:09,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:09,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238093608] [2022-02-21 03:31:09,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238093608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:09,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:09,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:31:09,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675202077] [2022-02-21 03:31:09,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:09,453 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:09,453 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2022-02-21 03:31:09,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:09,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113916967] [2022-02-21 03:31:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:09,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:09,479 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:09,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:09,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:31:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:31:09,679 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:31:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:10,025 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 03:31:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:31:10,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:31:10,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:10,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-02-21 03:31:10,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:10,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2022-02-21 03:31:10,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-02-21 03:31:10,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-02-21 03:31:10,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2022-02-21 03:31:10,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:10,048 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-02-21 03:31:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2022-02-21 03:31:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-02-21 03:31:10,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:10,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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:31:10,050 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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:31:10,051 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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:31:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:10,052 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 03:31:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-02-21 03:31:10,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:10,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:10,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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 45 states and 58 transitions. [2022-02-21 03:31:10,053 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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 45 states and 58 transitions. [2022-02-21 03:31:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:10,054 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 03:31:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-02-21 03:31:10,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:10,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:10,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:10,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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:31:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-21 03:31:10,056 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-21 03:31:10,056 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-21 03:31:10,056 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:31:10,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2022-02-21 03:31:10,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:10,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:10,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:10,058 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:10,058 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:10,058 INFO L791 eck$LassoCheckResult]: Stem: 876#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 877#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 890#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 884#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 885#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 899#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 905#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 891#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 892#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 902#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 878#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 879#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 904#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 900#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 903#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 897#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 886#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 887#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 893#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 882#L598-4 [2022-02-21 03:31:10,058 INFO L793 eck$LassoCheckResult]: Loop: 882#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 883#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 898#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 882#L598-4 [2022-02-21 03:31:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2033636544, now seen corresponding path program 1 times [2022-02-21 03:31:10,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:10,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487987359] [2022-02-21 03:31:10,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:10,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {1003#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1003#true} is VALID [2022-02-21 03:31:10,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1003#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {1003#true} is VALID [2022-02-21 03:31:10,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#true} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); {1003#true} is VALID [2022-02-21 03:31:10,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {1003#true} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1003#true} is VALID [2022-02-21 03:31:10,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {1003#true} assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; {1003#true} is VALID [2022-02-21 03:31:10,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {1003#true} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1003#true} is VALID [2022-02-21 03:31:10,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {1003#true} assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; {1003#true} is VALID [2022-02-21 03:31:10,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#true} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1005#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:10,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {1005#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; {1006#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {1006#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1006#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {1006#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; {1007#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {1007#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1008#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem28#1|) 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:10,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {1008#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem28#1|) 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {1009#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:10,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {1009#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1010#(<= (+ |ULTIMATE.start_main_#t~mem33#1| 4) 0)} is VALID [2022-02-21 03:31:10,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#(<= (+ |ULTIMATE.start_main_#t~mem33#1| 4) 0)} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {1004#false} is VALID [2022-02-21 03:31:10,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {1004#false} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1004#false} is VALID [2022-02-21 03:31:10,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {1004#false} assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; {1004#false} is VALID [2022-02-21 03:31:10,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {1004#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1004#false} is VALID [2022-02-21 03:31:10,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {1004#false} assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; {1004#false} is VALID [2022-02-21 03:31:10,179 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:31:10,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:10,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487987359] [2022-02-21 03:31:10,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487987359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:10,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:10,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:31:10,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612093212] [2022-02-21 03:31:10,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:10,182 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2022-02-21 03:31:10,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:10,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077418486] [2022-02-21 03:31:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:10,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:10,219 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:10,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:10,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:31:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:31:10,402 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:31:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:10,705 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-21 03:31:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:31:10,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:31:10,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:10,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 67 transitions. [2022-02-21 03:31:10,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:10,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 67 transitions. [2022-02-21 03:31:10,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-02-21 03:31:10,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-02-21 03:31:10,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2022-02-21 03:31:10,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:10,730 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-02-21 03:31:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2022-02-21 03:31:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-02-21 03:31:10,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:10,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states and 67 transitions. Second operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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:31:10,733 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states and 67 transitions. Second operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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:31:10,733 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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:31:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:10,734 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-21 03:31:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-02-21 03:31:10,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:10,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:10,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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 52 states and 67 transitions. [2022-02-21 03:31:10,735 INFO L87 Difference]: Start difference. First operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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 52 states and 67 transitions. [2022-02-21 03:31:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:10,737 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-21 03:31:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-02-21 03:31:10,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:10,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:10,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:10,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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:31:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-02-21 03:31:10,738 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-02-21 03:31:10,739 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-02-21 03:31:10,739 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:31:10,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2022-02-21 03:31:10,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:10,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:10,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:10,740 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:10,740 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:10,740 INFO L791 eck$LassoCheckResult]: Stem: 1065#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1066#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1081#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1084#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1087#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 1077#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1078#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 1079#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1080#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 1095#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1067#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 1068#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1083#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 1088#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1096#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 1085#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1073#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 1074#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1082#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 1071#L598-4 [2022-02-21 03:31:10,741 INFO L793 eck$LassoCheckResult]: Loop: 1071#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1072#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1086#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1071#L598-4 [2022-02-21 03:31:10,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash 486323390, now seen corresponding path program 1 times [2022-02-21 03:31:10,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:10,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647202760] [2022-02-21 03:31:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:10,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {1208#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1208#true} is VALID [2022-02-21 03:31:10,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {1208#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {1208#true} is VALID [2022-02-21 03:31:10,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {1208#true} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); {1208#true} is VALID [2022-02-21 03:31:10,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {1208#true} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1210#(= (+ |ULTIMATE.start_main_#t~mem8#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0)} is VALID [2022-02-21 03:31:10,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {1210#(= (+ |ULTIMATE.start_main_#t~mem8#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0)} assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; {1211#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1212#(and (<= 2 |ULTIMATE.start_main_#t~mem13#1|) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0))} is VALID [2022-02-21 03:31:10,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {1212#(and (<= 2 |ULTIMATE.start_main_#t~mem13#1|) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0))} assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; {1213#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {1213#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1214#(and (= 0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem18#1|)) (<= 3 |ULTIMATE.start_main_#t~mem18#1|))} is VALID [2022-02-21 03:31:10,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {1214#(and (= 0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem18#1|)) (<= 3 |ULTIMATE.start_main_#t~mem18#1|))} assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; {1215#(<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {1215#(<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1215#(<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {1215#(<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; {1216#(<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {1216#(<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1216#(<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; {1217#(<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {1217#(<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1218#(and (<= 6 |ULTIMATE.start_main_#t~mem33#1|) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem33#1|) 0))} is VALID [2022-02-21 03:31:10,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {1218#(and (<= 6 |ULTIMATE.start_main_#t~mem33#1|) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem33#1|) 0))} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {1219#(<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:10,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {1219#(<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1220#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem38#1|) 0) (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:10,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {1220#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem38#1|) 0) (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; {1209#false} is VALID [2022-02-21 03:31:10,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {1209#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1209#false} is VALID [2022-02-21 03:31:10,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {1209#false} assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; {1209#false} is VALID [2022-02-21 03:31:10,932 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:31:10,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:10,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647202760] [2022-02-21 03:31:10,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647202760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:10,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:10,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-21 03:31:10,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962963124] [2022-02-21 03:31:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:10,933 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:10,934 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2022-02-21 03:31:10,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:10,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717930480] [2022-02-21 03:31:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:10,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:10,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:10,954 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:11,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:11,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:31:11,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:31:11,141 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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:31:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:11,450 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-02-21 03:31:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:31:11,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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:31:11,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:11,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2022-02-21 03:31:11,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:11,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 59 transitions. [2022-02-21 03:31:11,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2022-02-21 03:31:11,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2022-02-21 03:31:11,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 59 transitions. [2022-02-21 03:31:11,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:11,472 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-02-21 03:31:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 59 transitions. [2022-02-21 03:31:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-02-21 03:31:11,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:11,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states and 59 transitions. Second operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 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:31:11,474 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states and 59 transitions. Second operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 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:31:11,474 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 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:31:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:11,475 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-02-21 03:31:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-02-21 03:31:11,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:11,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:11,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 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 48 states and 59 transitions. [2022-02-21 03:31:11,476 INFO L87 Difference]: Start difference. First operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 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 48 states and 59 transitions. [2022-02-21 03:31:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:11,477 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-02-21 03:31:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-02-21 03:31:11,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:11,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:11,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:11,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 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:31:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-02-21 03:31:11,482 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-02-21 03:31:11,482 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-02-21 03:31:11,482 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:31:11,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2022-02-21 03:31:11,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:11,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:11,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:11,483 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:11,483 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:11,483 INFO L791 eck$LassoCheckResult]: Stem: 1271#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1285#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1290#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1310#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 1309#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1308#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 1307#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1306#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 1305#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1273#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 1274#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1289#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 1275#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1276#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 1291#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1281#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1282#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1288#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 1277#L598-4 [2022-02-21 03:31:11,483 INFO L793 eck$LassoCheckResult]: Loop: 1277#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1278#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1292#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1277#L598-4 [2022-02-21 03:31:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2022-02-21 03:31:11,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:11,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243998630] [2022-02-21 03:31:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:11,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {1410#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1410#true} is VALID [2022-02-21 03:31:11,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {1410#true} is VALID [2022-02-21 03:31:11,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {1410#true} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); {1410#true} is VALID [2022-02-21 03:31:11,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {1410#true} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1410#true} is VALID [2022-02-21 03:31:11,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {1410#true} assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; {1410#true} is VALID [2022-02-21 03:31:11,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {1410#true} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1410#true} is VALID [2022-02-21 03:31:11,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#true} assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; {1410#true} is VALID [2022-02-21 03:31:11,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#true} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1410#true} is VALID [2022-02-21 03:31:11,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {1410#true} assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; {1410#true} is VALID [2022-02-21 03:31:11,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {1410#true} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1410#true} is VALID [2022-02-21 03:31:11,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {1410#true} assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; {1410#true} is VALID [2022-02-21 03:31:11,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {1410#true} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1410#true} is VALID [2022-02-21 03:31:11,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {1410#true} assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; {1410#true} is VALID [2022-02-21 03:31:11,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {1410#true} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1410#true} is VALID [2022-02-21 03:31:11,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {1410#true} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {1410#true} is VALID [2022-02-21 03:31:11,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {1410#true} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1412#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem38#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:11,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {1412#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem38#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; {1413#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:11,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {1413#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1414#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem43#1|) 0) (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:11,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {1414#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem43#1|) 0) (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; {1411#false} is VALID [2022-02-21 03:31:11,546 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:31:11,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:11,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243998630] [2022-02-21 03:31:11,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243998630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:11,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:11,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:31:11,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690687002] [2022-02-21 03:31:11,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:11,547 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:11,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2022-02-21 03:31:11,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:11,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985079662] [2022-02-21 03:31:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:11,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:11,566 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:11,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:11,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:31:11,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:31:11,751 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 9 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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:31:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:11,925 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-02-21 03:31:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:31:11,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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:31:11,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:11,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2022-02-21 03:31:11,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:11,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 54 transitions. [2022-02-21 03:31:11,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-02-21 03:31:11,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-02-21 03:31:11,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2022-02-21 03:31:11,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:11,946 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-02-21 03:31:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2022-02-21 03:31:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-02-21 03:31:11,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:11,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 54 transitions. Second operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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:31:11,948 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 54 transitions. Second operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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:31:11,948 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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:31:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:11,949 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-02-21 03:31:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-02-21 03:31:11,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:11,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:11,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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 45 states and 54 transitions. [2022-02-21 03:31:11,950 INFO L87 Difference]: Start difference. First operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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 45 states and 54 transitions. [2022-02-21 03:31:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:11,951 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-02-21 03:31:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-02-21 03:31:11,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:11,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:11,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:11,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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:31:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-02-21 03:31:11,953 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-02-21 03:31:11,953 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-02-21 03:31:11,953 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:31:11,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2022-02-21 03:31:11,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:11,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:11,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:11,954 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:11,954 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:11,955 INFO L791 eck$LassoCheckResult]: Stem: 1462#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1463#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1476#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1470#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1471#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 1474#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1475#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 1501#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1500#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 1499#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1464#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 1465#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1481#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 1466#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1467#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 1484#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1472#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1473#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1482#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1468#L598-4 [2022-02-21 03:31:11,955 INFO L793 eck$LassoCheckResult]: Loop: 1468#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1469#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1485#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1468#L598-4 [2022-02-21 03:31:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2022-02-21 03:31:11,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:11,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359012693] [2022-02-21 03:31:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:12,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:12,056 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:12,057 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2022-02-21 03:31:12,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:12,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991535770] [2022-02-21 03:31:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:12,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:12,091 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:12,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2022-02-21 03:31:12,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:12,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890913948] [2022-02-21 03:31:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:12,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:12,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:12,201 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:16,962 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:31:16,963 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:31:16,963 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:31:16,963 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:31:16,963 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:31:16,963 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:16,963 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:31:16,963 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:31:16,963 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration9_Lasso [2022-02-21 03:31:16,964 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:31:16,964 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:31:16,984 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:31:16,989 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:31:16,991 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:31:16,994 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:31:16,996 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:31:16,998 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:31:17,000 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:31:17,002 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:31:17,005 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:31:17,007 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:31:17,009 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:31:17,010 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:31:17,012 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:31:17,014 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:31:17,017 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:31:17,019 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:31:17,021 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:31:17,023 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:31:17,025 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:31:17,026 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:31:17,028 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:31:17,030 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:31:17,032 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:31:17,034 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:31:17,036 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:31:17,038 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:31:17,040 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:31:17,041 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:31:17,043 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:31:17,045 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:31:17,047 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:31:17,056 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:31:17,058 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:31:17,724 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:31:17,726 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:31:17,729 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:31:17,731 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:31:17,733 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:31:17,734 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:31:17,737 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:31:17,739 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:31:17,741 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:31:17,742 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:31:17,745 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:31:17,746 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:31:17,748 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:31:17,750 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:31:17,751 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:31:17,755 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:31:17,757 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:31:17,758 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:31:17,765 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:31:17,768 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:31:17,769 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:31:17,771 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:31:17,772 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:31:17,775 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:31:18,515 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:31:18,519 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:31:18,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,521 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:31:18,522 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:31:18,526 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:31:18,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,587 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:31:18,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,589 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:31:18,600 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:31:18,600 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:31:18,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,625 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:31:18,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,626 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:31:18,627 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:31:18,630 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:31:18,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:31:18,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,658 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:31:18,661 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:31:18,661 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:31:18,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:31:18,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,686 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:31:18,687 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:31:18,688 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:31:18,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,710 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:31:18,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,711 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:31:18,712 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:31:18,713 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:31:18,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,737 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:31:18,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,738 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:31:18,740 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:31:18,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:31:18,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:18,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,765 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:31:18,769 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:31:18,770 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:31:18,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:18,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:18,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:31:18,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,815 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:31:18,825 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:31:18,825 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:31:18,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,850 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:31:18,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,851 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:31:18,852 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:31:18,854 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:31:18,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,878 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:31:18,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,880 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:31:18,880 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:31:18,882 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:31:18,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:31:18,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,908 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:31:18,908 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:31:18,910 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:31:18,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,933 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:31:18,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,935 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:31:18,936 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:31:18,937 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:31:18,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,960 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:31:18,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,961 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:31:18,966 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:31:18,967 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:31:18,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:18,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:18,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:18,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:18,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:18,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:18,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:18,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:18,991 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:31:18,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:18,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:18,992 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:31:18,998 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:31:18,998 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:31:19,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,020 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:31:19,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,022 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:31:19,022 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:31:19,024 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:31:19,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:31:19,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,052 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:31:19,053 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:31:19,054 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:31:19,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,079 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:31:19,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,081 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:31:19,081 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:31:19,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:19,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,106 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:31:19,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,107 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:31:19,108 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:31:19,110 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:31:19,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:31:19,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,134 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:31:19,135 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:31:19,136 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:31:19,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:31:19,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,160 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:31:19,167 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:31:19,168 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:31:19,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,190 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:31:19,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,191 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:31:19,192 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:31:19,195 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:31:19,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:31:19,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,218 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:31:19,218 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:31:19,220 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:31:19,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,243 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:31:19,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,245 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:31:19,245 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:31:19,246 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:31:19,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:31:19,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,272 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:31:19,272 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:31:19,274 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:31:19,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:31:19,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,299 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:31:19,301 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:31:19,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:31:19,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,325 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:31:19,327 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:31:19,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:31:19,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,351 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:31:19,354 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:31:19,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:31:19,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,377 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:31:19,379 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:31:19,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:19,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,416 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,419 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:31:19,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:31:19,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:31:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,465 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:31:19,468 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:31:19,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:19,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:19,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:19,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:19,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,490 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:31:19,492 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:31:19,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:31:19,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,542 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:31:19,544 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:31:19,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:31:19,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,571 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:31:19,573 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:31:19,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:19,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,602 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:31:19,604 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:31:19,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:31:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,643 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:31:19,645 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:31:19,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:19,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,699 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:31:19,701 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:31:19,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:31:19,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,755 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:31:19,757 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:31:19,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 03:31:19,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,782 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:31:19,784 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:31:19,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:19,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 03:31:19,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,813 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:19,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:31:19,816 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:31:19,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:19,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:19,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:19,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:19,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:19,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:19,858 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:31:19,870 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:31:19,870 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:31:19,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:19,879 INFO L229 MonitoredProcess]: Starting monitored process 42 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:31:19,887 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:31:19,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:31:19,944 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:31:19,944 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:31:19,945 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1 + 100 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 - 2 >= 0] [2022-02-21 03:31:19,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:20,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:31:20,272 INFO L297 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2022-02-21 03:31:20,291 INFO L390 LassoCheck]: Loop: "call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100;" "assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100;" "assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1;" [2022-02-21 03:31:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:20,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:20,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-21 03:31:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:20,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:20,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-02-21 03:31:20,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:31:20,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:31:20,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:31:21,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:31:21,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:31:21,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:31:21,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:31:21,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {1603#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1603#unseeded} is VALID [2022-02-21 03:31:21,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1603#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {1834#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {1834#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); {1834#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {1834#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1841#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:21,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {1841#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; {1822#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (>= (+ (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (>= (+ (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1822#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (>= (+ (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {1822#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (>= (+ (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; {1851#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {1851#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1851#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1851#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; {1858#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {1858#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1858#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {1858#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; {1865#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:21,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {1865#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1865#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:21,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {1865#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; {1872#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {1872#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1872#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {1872#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {1879#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {1879#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1879#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {1879#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; {1886#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:21,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {1886#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {1886#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:21,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1886#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; {1822#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (>= (+ (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:21,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:31:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:21,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:21,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {1823#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (>= (+ (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) 100)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; {1893#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (>= (+ (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) 100)) (or (not |ULTIMATE.start_main_#t~short50#1|) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 100)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {1893#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (>= (+ (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) 100)) (or (not |ULTIMATE.start_main_#t~short50#1|) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 100)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; {1897#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (<= 100 (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) oldRank0)) (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 100))} is VALID [2022-02-21 03:31:21,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {1897#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (<= 100 (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) oldRank0)) (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 100))} assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; {1825#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (>= (+ (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) 100)))) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:21,900 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:31:21,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:21,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:21,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:21,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:21,937 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2022-02-21 03:31:21,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:22,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 9. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 57 states and 69 transitions. Complement of second has 17 states. [2022-02-21 03:31:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2022-02-21 03:31:22,477 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:22,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. cyclomatic complexity: 9 [2022-02-21 03:31:22,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:22,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:22,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:22,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:22,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:22,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:22,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 69 transitions. [2022-02-21 03:31:22,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:31:22,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:22,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:22,484 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 50 transitions. cyclomatic complexity: 9 [2022-02-21 03:31:22,485 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:31:22,485 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:22,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:22,487 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:31:22,487 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 57 states and 69 transitions. cyclomatic complexity: 15 [2022-02-21 03:31:22,489 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:31:22,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:31:22,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:31:22,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:31:22,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 57 letters. Loop has 57 letters. [2022-02-21 03:31:22,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 57 letters. [2022-02-21 03:31:22,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 57 letters. Loop has 57 letters. [2022-02-21 03:31:22,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:31:22,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:31:22,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:31:22,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:31:22,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:31:22,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:31:22,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:22,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:22,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:22,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:22,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:22,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:22,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:31:22,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:31:22,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:31:22,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:22,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:22,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:22,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:22,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:22,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:22,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:22,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:22,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:22,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:31:22,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:31:22,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:31:22,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:31:22,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:31:22,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 69 transitions. cyclomatic complexity: 15 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:31:22,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,505 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-02-21 03:31:22,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:22,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:31:22,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:31:22,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:22,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. cyclomatic complexity: 15 [2022-02-21 03:31:22,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:31:22,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 33 states and 42 transitions. [2022-02-21 03:31:22,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-02-21 03:31:22,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-02-21 03:31:22,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2022-02-21 03:31:22,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:22,511 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-21 03:31:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2022-02-21 03:31:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-02-21 03:31:22,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:22,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 42 transitions. Second operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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:31:22,513 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 42 transitions. Second operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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:31:22,513 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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:31:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:22,514 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-21 03:31:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-21 03:31:22,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:22,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:22,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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 33 states and 42 transitions. [2022-02-21 03:31:22,515 INFO L87 Difference]: Start difference. First operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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 33 states and 42 transitions. [2022-02-21 03:31:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:22,516 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-21 03:31:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-21 03:31:22,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:22,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:22,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:22,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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:31:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-02-21 03:31:22,518 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-02-21 03:31:22,518 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-02-21 03:31:22,518 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:31:22,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2022-02-21 03:31:22,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:22,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:22,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:22,519 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:22,519 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:22,520 INFO L791 eck$LassoCheckResult]: Stem: 1992#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 2010#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 2004#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2005#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 2006#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2007#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 2008#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2009#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 2017#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1996#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 1997#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2012#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1999#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2000#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 2016#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2001#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 2002#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2013#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1994#L598-4 [2022-02-21 03:31:22,520 INFO L793 eck$LassoCheckResult]: Loop: 1994#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1995#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 2014#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1994#L598-4 [2022-02-21 03:31:22,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash -492624188, now seen corresponding path program 1 times [2022-02-21 03:31:22,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:22,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273253327] [2022-02-21 03:31:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:22,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:22,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {2089#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2089#true} is VALID [2022-02-21 03:31:22,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2089#true} is VALID [2022-02-21 03:31:22,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {2089#true} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); {2091#(= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:31:22,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {2091#(= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2092#(and (= (+ |ULTIMATE.start_main_#t~mem8#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0))} is VALID [2022-02-21 03:31:22,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {2092#(and (= (+ |ULTIMATE.start_main_#t~mem8#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0))} assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; {2093#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:22,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {2093#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2093#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:22,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {2093#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; {2094#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:22,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {2094#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2095#(and (= 0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem18#1|)) (<= (+ 3 |ULTIMATE.start_main_#t~mem18#1|) 0))} is VALID [2022-02-21 03:31:22,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {2095#(and (= 0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem18#1|)) (<= (+ 3 |ULTIMATE.start_main_#t~mem18#1|) 0))} assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; {2096#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:22,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2097#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem23#1|) 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0))} is VALID [2022-02-21 03:31:22,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {2097#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem23#1|) 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0))} assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; {2090#false} is VALID [2022-02-21 03:31:22,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {2090#false} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2090#false} is VALID [2022-02-21 03:31:22,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {2090#false} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {2098#(<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:22,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {2098#(<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2099#(and (<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem33#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:22,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {2099#(and (<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem33#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {2090#false} is VALID [2022-02-21 03:31:22,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {2090#false} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2090#false} is VALID [2022-02-21 03:31:22,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {2090#false} assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; {2090#false} is VALID [2022-02-21 03:31:22,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {2090#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2090#false} is VALID [2022-02-21 03:31:22,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {2090#false} assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; {2090#false} is VALID [2022-02-21 03:31:22,704 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:31:22,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:22,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273253327] [2022-02-21 03:31:22,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273253327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:22,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:22,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-21 03:31:22,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612214752] [2022-02-21 03:31:22,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:22,705 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2022-02-21 03:31:22,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:22,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426322364] [2022-02-21 03:31:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:22,723 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:22,731 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:22,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:22,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:31:22,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:31:22,909 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 8 Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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:31:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:23,289 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-21 03:31:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:31:23,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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:31:23,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:23,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2022-02-21 03:31:23,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:23,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2022-02-21 03:31:23,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-02-21 03:31:23,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-02-21 03:31:23,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2022-02-21 03:31:23,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:23,310 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-02-21 03:31:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2022-02-21 03:31:23,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2022-02-21 03:31:23,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:23,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 51 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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:31:23,311 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 51 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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:31:23,311 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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:31:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:23,312 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-21 03:31:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:31:23,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:23,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:23,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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 41 states and 51 transitions. [2022-02-21 03:31:23,313 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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 41 states and 51 transitions. [2022-02-21 03:31:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:23,313 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-21 03:31:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:31:23,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:23,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:23,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:23,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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:31:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-02-21 03:31:23,314 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-21 03:31:23,314 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-21 03:31:23,314 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 03:31:23,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2022-02-21 03:31:23,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:23,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:23,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:23,315 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:23,315 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:23,315 INFO L791 eck$LassoCheckResult]: Stem: 2143#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 2158#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 2154#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2155#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 2156#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2157#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 2159#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2160#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 2167#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2145#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 2146#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2162#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 2147#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2148#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 2164#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2151#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 2152#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2161#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 2149#L598-4 [2022-02-21 03:31:23,315 INFO L793 eck$LassoCheckResult]: Loop: 2149#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 2150#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 2165#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 2149#L598-4 [2022-02-21 03:31:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1587573180, now seen corresponding path program 1 times [2022-02-21 03:31:23,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:23,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078676813] [2022-02-21 03:31:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:23,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:23,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {2254#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2254#true} is VALID [2022-02-21 03:31:23,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2254#true} is VALID [2022-02-21 03:31:23,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); {2254#true} is VALID [2022-02-21 03:31:23,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {2254#true} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2256#(= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0)} is VALID [2022-02-21 03:31:23,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {2256#(= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0)} assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; {2257#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0)} is VALID [2022-02-21 03:31:23,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {2257#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0)} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2258#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0) (<= (+ |ULTIMATE.start_main_#t~mem13#1| 1) 0))} is VALID [2022-02-21 03:31:23,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {2258#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0) (<= (+ |ULTIMATE.start_main_#t~mem13#1| 1) 0))} assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; {2259#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:23,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2260#(and (= 0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem18#1|)) (<= (+ 2 |ULTIMATE.start_main_#t~mem18#1|) 0))} is VALID [2022-02-21 03:31:23,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (= 0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem18#1|)) (<= (+ 2 |ULTIMATE.start_main_#t~mem18#1|) 0))} assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; {2261#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:23,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {2261#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2261#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:23,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; {2262#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:23,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {2262#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2263#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem28#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:23,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {2263#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem28#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; {2255#false} is VALID [2022-02-21 03:31:23,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {2255#false} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2255#false} is VALID [2022-02-21 03:31:23,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {2255#false} assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; {2255#false} is VALID [2022-02-21 03:31:23,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {2255#false} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2255#false} is VALID [2022-02-21 03:31:23,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {2255#false} assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; {2255#false} is VALID [2022-02-21 03:31:23,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {2255#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2255#false} is VALID [2022-02-21 03:31:23,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {2255#false} assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; {2255#false} is VALID [2022-02-21 03:31:23,478 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:31:23,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:23,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078676813] [2022-02-21 03:31:23,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078676813] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:23,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:23,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-21 03:31:23,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584363819] [2022-02-21 03:31:23,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:23,479 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2022-02-21 03:31:23,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:23,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184038429] [2022-02-21 03:31:23,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:23,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:23,501 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:23,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:23,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:31:23,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:31:23,673 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 6 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:31:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:24,069 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-21 03:31:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:31:24,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:31:24,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:24,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2022-02-21 03:31:24,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:24,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2022-02-21 03:31:24,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-02-21 03:31:24,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-02-21 03:31:24,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2022-02-21 03:31:24,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:24,094 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-02-21 03:31:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2022-02-21 03:31:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2022-02-21 03:31:24,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:24,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 39 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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:31:24,101 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 39 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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:31:24,101 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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:31:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:24,102 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-21 03:31:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-21 03:31:24,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:24,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:24,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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 33 states and 39 transitions. [2022-02-21 03:31:24,109 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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 33 states and 39 transitions. [2022-02-21 03:31:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:24,112 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-21 03:31:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-21 03:31:24,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:24,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:24,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:24,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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:31:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-21 03:31:24,116 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-21 03:31:24,116 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-21 03:31:24,116 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2022-02-21 03:31:24,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2022-02-21 03:31:24,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:24,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:24,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:24,117 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:24,118 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:24,118 INFO L791 eck$LassoCheckResult]: Stem: 2305#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2306#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 2320#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 2313#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2314#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 2318#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2319#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 2321#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2322#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 2328#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2307#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 2308#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2324#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 2309#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2310#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 2327#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2315#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 2316#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2325#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 2311#L598-4 [2022-02-21 03:31:24,120 INFO L793 eck$LassoCheckResult]: Loop: 2311#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 2312#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 2326#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 2311#L598-4 [2022-02-21 03:31:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash 189281224, now seen corresponding path program 1 times [2022-02-21 03:31:24,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:24,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749436181] [2022-02-21 03:31:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:24,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:24,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2398#true} is VALID [2022-02-21 03:31:24,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2398#true} is VALID [2022-02-21 03:31:24,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); {2400#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0)} is VALID [2022-02-21 03:31:24,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {2400#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0)} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2401#(and (<= (+ |ULTIMATE.start_main_#t~mem8#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0))} is VALID [2022-02-21 03:31:24,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {2401#(and (<= (+ |ULTIMATE.start_main_#t~mem8#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0))} assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; {2402#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:24,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {2402#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2403#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem13#1|) 0))} is VALID [2022-02-21 03:31:24,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {2403#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem13#1|) 0))} assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; {2404#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:24,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {2404#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2405#(and (<= (+ 3 |ULTIMATE.start_main_#t~mem18#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:24,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {2405#(and (<= (+ 3 |ULTIMATE.start_main_#t~mem18#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; {2406#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:24,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {2406#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2406#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:24,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {2406#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; {2407#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:24,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {2407#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2407#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:24,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {2407#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {2408#(<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:24,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {2408#(<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2409#(and (<= (+ 6 |ULTIMATE.start_main_#t~mem33#1|) 0) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem33#1|) 0))} is VALID [2022-02-21 03:31:24,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {2409#(and (<= (+ 6 |ULTIMATE.start_main_#t~mem33#1|) 0) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem33#1|) 0))} assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; {2410#(<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:24,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {2410#(<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2411#(and (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem38#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:24,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {2411#(and (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem38#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; {2399#false} is VALID [2022-02-21 03:31:24,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {2399#false} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2399#false} is VALID [2022-02-21 03:31:24,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {2399#false} assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; {2399#false} is VALID [2022-02-21 03:31:24,331 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:31:24,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:24,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749436181] [2022-02-21 03:31:24,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749436181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:24,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:24,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-21 03:31:24,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538376345] [2022-02-21 03:31:24,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:24,331 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2022-02-21 03:31:24,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:24,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602108073] [2022-02-21 03:31:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:24,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:24,354 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:24,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:24,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:31:24,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:31:24,542 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 4 Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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:31:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:24,888 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-02-21 03:31:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 03:31:24,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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:31:24,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:24,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2022-02-21 03:31:24,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:24,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2022-02-21 03:31:24,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-02-21 03:31:24,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-02-21 03:31:24,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2022-02-21 03:31:24,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:24,911 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-21 03:31:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2022-02-21 03:31:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-02-21 03:31:24,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:24,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 32 transitions. Second operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:24,912 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 32 transitions. Second operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:24,913 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:24,913 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-02-21 03:31:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-21 03:31:24,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:24,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:24,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states and 32 transitions. [2022-02-21 03:31:24,913 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states and 32 transitions. [2022-02-21 03:31:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:24,914 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-02-21 03:31:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-21 03:31:24,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:24,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:24,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:24,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-21 03:31:24,918 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-21 03:31:24,918 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-21 03:31:24,918 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2022-02-21 03:31:24,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2022-02-21 03:31:24,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:24,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:24,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:24,919 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:24,919 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:24,919 INFO L791 eck$LassoCheckResult]: Stem: 2442#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 2456#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 2450#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2451#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 2454#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2455#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 2457#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2458#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 2463#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2446#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 2447#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2460#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 2448#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2449#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 2462#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2452#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 2453#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2459#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 2444#L598-4 [2022-02-21 03:31:24,920 INFO L793 eck$LassoCheckResult]: Loop: 2444#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 2445#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 2461#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 2444#L598-4 [2022-02-21 03:31:24,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2022-02-21 03:31:24,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:24,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554961577] [2022-02-21 03:31:24,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:24,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:24,979 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:25,000 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2022-02-21 03:31:25,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:25,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702343214] [2022-02-21 03:31:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:25,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:25,043 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2022-02-21 03:31:25,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:25,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668565406] [2022-02-21 03:31:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:25,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:25,129 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:29,868 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:31:29,868 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:31:29,868 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:31:29,868 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:31:29,869 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:31:29,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:29,869 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:31:29,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:31:29,869 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration13_Lasso [2022-02-21 03:31:29,869 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:31:29,869 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:31:29,873 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:31:30,422 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:31:30,424 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:31:30,426 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:31:30,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:30,429 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:31:30,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:30,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:30,443 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:31:30,445 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:31:30,447 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:31:30,449 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:31:30,451 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:31:30,452 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:31:30,454 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:31:30,456 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:31:30,457 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:31:30,459 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:31:30,461 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:31:30,462 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:31:30,464 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:31:30,466 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:31:30,467 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:31:30,469 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:31:30,471 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:31:30,472 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:31:30,474 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:31:30,476 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:31:30,477 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:31:30,481 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:31:30,483 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:31:30,485 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:31:30,487 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:31:30,489 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:31:30,492 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:31:30,494 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:31:30,496 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:31:30,497 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:31:30,499 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:31:30,501 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:31:30,502 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:31:30,504 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:31:30,506 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:31:30,507 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:31:30,509 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:31:30,513 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:31:30,514 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:31:30,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:31:30,527 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:31:30,528 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:31:30,530 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:31:30,532 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:31:30,533 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:31:30,535 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:31:30,537 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:31:30,539 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:31:30,540 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:31:31,259 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:31:31,259 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:31:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,262 INFO L229 MonitoredProcess]: Starting monitored process 43 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:31:31,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:31:31,265 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:31:31,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:31,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:31,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,292 INFO L229 MonitoredProcess]: Starting monitored process 44 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:31:31,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:31:31,304 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:31:31,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:31,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:31:31,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,332 INFO L229 MonitoredProcess]: Starting monitored process 45 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:31:31,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:31:31,334 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:31:31,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:31,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 03:31:31,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,361 INFO L229 MonitoredProcess]: Starting monitored process 46 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:31:31,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:31:31,363 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:31:31,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:31,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:31:31,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,392 INFO L229 MonitoredProcess]: Starting monitored process 47 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:31:31,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:31:31,395 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:31:31,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:31,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 03:31:31,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,420 INFO L229 MonitoredProcess]: Starting monitored process 48 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:31:31,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:31:31,422 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:31:31,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:31,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:31,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,487 INFO L229 MonitoredProcess]: Starting monitored process 49 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:31:31,491 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:31:31,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:31:31,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:31,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:31,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,535 INFO L229 MonitoredProcess]: Starting monitored process 50 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:31:31,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:31:31,538 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:31:31,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:31,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:31,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,577 INFO L229 MonitoredProcess]: Starting monitored process 51 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:31:31,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:31:31,580 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:31:31,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:31,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:31:31,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,606 INFO L229 MonitoredProcess]: Starting monitored process 52 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:31:31,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:31:31,608 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:31:31,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:31,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:31,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:31,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:31,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:31,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:31,622 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:31:31,628 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:31:31,628 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:31:31,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:31,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:31,629 INFO L229 MonitoredProcess]: Starting monitored process 53 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:31:31,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:31:31,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:31:31,637 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:31:31,637 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:31:31,638 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0#1.base) ULTIMATE.start_main_~z~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0#1.base) ULTIMATE.start_main_~z~0#1.offset)_2 + 100 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 - 2 >= 0] [2022-02-21 03:31:31,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:31,874 INFO L297 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2022-02-21 03:31:31,893 INFO L390 LassoCheck]: Loop: "call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100;" "assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100;" "assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1;" [2022-02-21 03:31:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:31,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-21 03:31:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:31,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:32,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-02-21 03:31:32,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:31:32,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:32,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-02-21 03:31:32,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-02-21 03:31:32,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-02-21 03:31:32,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-02-21 03:31:32,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-02-21 03:31:32,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-02-21 03:31:33,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-02-21 03:31:33,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {2529#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2529#unseeded} is VALID [2022-02-21 03:31:33,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {2529#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2760#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:33,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); {2764#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:33,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {2764#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2764#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:33,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {2764#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; {2748#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} is VALID [2022-02-21 03:31:33,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {2748#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2748#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} is VALID [2022-02-21 03:31:33,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {2748#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; {2777#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:33,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {2777#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2777#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:33,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {2777#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; {2784#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:33,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {2784#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2784#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:33,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {2784#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; {2791#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:33,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {2791#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2791#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:33,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {2791#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {2798#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:33,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {2798#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2798#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:33,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {2798#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; {2805#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:33,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {2805#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2805#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:33,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {2805#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; {2812#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (<= (+ 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:33,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {2812#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (<= (+ 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2812#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (<= (+ 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} is VALID [2022-02-21 03:31:33,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {2812#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (<= (+ 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|))} assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; {2748#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} is VALID [2022-02-21 03:31:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:33,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:31:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:33,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:33,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {2749#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|)) 100)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; {2749#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|)) 100)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} is VALID [2022-02-21 03:31:33,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {2749#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|)) 100)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; {2822#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|)) 100)) (or (not |ULTIMATE.start_main_#t~short50#1|) (< (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) 100)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} is VALID [2022-02-21 03:31:33,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|)) 100)) (or (not |ULTIMATE.start_main_#t~short50#1|) (< (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) 100)) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; {2751#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|)) 100))) unseeded) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~z~0#1.base|) (>= (+ (- 2) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) 0))} is VALID [2022-02-21 03:31:33,375 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:31:33,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:33,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,404 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2022-02-21 03:31:33,404 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,709 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 33 transitions. Complement of second has 15 states. [2022-02-21 03:31:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:33,709 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:33,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. cyclomatic complexity: 3 [2022-02-21 03:31:33,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:33,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:33,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:33,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:33,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:33,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2022-02-21 03:31:33,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:33,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:33,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:33,711 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 24 transitions. cyclomatic complexity: 3 [2022-02-21 03:31:33,711 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:31:33,711 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:33,712 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:31:33,712 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 33 transitions. cyclomatic complexity: 7 [2022-02-21 03:31:33,712 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:31:33,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:31:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:31:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:31:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:31:33,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:31:33,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:31:33,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:31:33,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:31:33,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:31:33,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:33,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:33,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:33,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:33,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:33,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:33,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:33,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:33,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:33,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:31:33,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:31:33,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:31:33,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:33,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:33,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:31:33,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:33,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:33,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:31:33,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 33 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,728 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2022-02-21 03:31:33,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:31:33,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:31:33,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:31:33,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. cyclomatic complexity: 7 [2022-02-21 03:31:33,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:33,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 23 transitions. [2022-02-21 03:31:33,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 03:31:33,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-02-21 03:31:33,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2022-02-21 03:31:33,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:33,732 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-21 03:31:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2022-02-21 03:31:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-21 03:31:33,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:33,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 23 transitions. Second operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,734 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 23 transitions. Second operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,734 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:33,734 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-21 03:31:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-21 03:31:33,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:33,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:33,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 23 transitions. [2022-02-21 03:31:33,735 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 23 transitions. [2022-02-21 03:31:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:33,736 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-21 03:31:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-21 03:31:33,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:33,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:33,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:33,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-02-21 03:31:33,737 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-21 03:31:33,737 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-21 03:31:33,737 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2022-02-21 03:31:33,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2022-02-21 03:31:33,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:31:33,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:33,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:33,738 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:33,738 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:31:33,738 INFO L791 eck$LassoCheckResult]: Stem: 2882#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2883#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 2896#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 2892#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2893#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 2894#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2895#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 2897#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2898#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 2903#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2888#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 2889#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2900#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 2884#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2885#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 2901#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2890#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 2891#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 2899#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 2886#L598-4 [2022-02-21 03:31:33,739 INFO L793 eck$LassoCheckResult]: Loop: 2886#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 2887#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 2902#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 2886#L598-4 [2022-02-21 03:31:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2022-02-21 03:31:33,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:33,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823853456] [2022-02-21 03:31:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:33,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {2951#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2951#true} is VALID [2022-02-21 03:31:33,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {2951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2951#true} is VALID [2022-02-21 03:31:33,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#true} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); {2953#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0)} is VALID [2022-02-21 03:31:33,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {2953#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) 0)} call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2954#(and (<= (+ |ULTIMATE.start_main_#t~mem8#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0))} is VALID [2022-02-21 03:31:33,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {2954#(and (<= (+ |ULTIMATE.start_main_#t~mem8#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem8#1|)) 0))} assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; {2955#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:33,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2956#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem13#1|) 0))} is VALID [2022-02-21 03:31:33,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {2956#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem13#1|) 0))} assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; {2957#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:33,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {2957#(<= (+ 3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2958#(and (<= (+ 3 |ULTIMATE.start_main_#t~mem18#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:33,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(and (<= (+ 3 |ULTIMATE.start_main_#t~mem18#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem18#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; {2959#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:33,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {2959#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2959#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} is VALID [2022-02-21 03:31:33,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {2959#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)} assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; {2960#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:33,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {2960#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2960#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:33,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {2960#(<= (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; {2961#(<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:33,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {2961#(<= (+ 6 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2962#(and (<= (+ 6 |ULTIMATE.start_main_#t~mem33#1|) 0) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem33#1|) 0))} is VALID [2022-02-21 03:31:33,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {2962#(and (<= (+ 6 |ULTIMATE.start_main_#t~mem33#1|) 0) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem33#1|) 0))} assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; {2963#(<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:33,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {2963#(<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2963#(<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:33,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {2963#(<= (+ 7 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; {2964#(<= (+ 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-21 03:31:33,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {2964#(<= (+ 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0)} call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {2965#(and (<= (+ 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem43#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} is VALID [2022-02-21 03:31:33,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {2965#(and (<= (+ 8 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem43#1|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0))} assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; {2952#false} is VALID [2022-02-21 03:31:33,976 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:31:33,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:33,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823853456] [2022-02-21 03:31:33,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823853456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:33,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:33,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-21 03:31:33,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970603572] [2022-02-21 03:31:33,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:33,977 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 14 times [2022-02-21 03:31:33,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:33,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100126754] [2022-02-21 03:31:33,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:34,009 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:34,017 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:34,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:34,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:31:34,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:31:34,164 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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:31:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:34,350 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-21 03:31:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:31:34,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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:31:34,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:34,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2022-02-21 03:31:34,369 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:34,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2022-02-21 03:31:34,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:31:34,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:31:34,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:31:34,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:34,370 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:31:34,370 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:31:34,370 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:31:34,370 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2022-02-21 03:31:34,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:31:34,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:34,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:34,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:31:34 BoogieIcfgContainer [2022-02-21 03:31:34,374 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:31:34,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:31:34,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:31:34,375 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:31:34,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:04" (3/4) ... [2022-02-21 03:31:34,377 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:31:34,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:31:34,378 INFO L158 Benchmark]: Toolchain (without parser) took 30628.11ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 61.7MB in the beginning and 91.7MB in the end (delta: -29.9MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2022-02-21 03:31:34,378 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory was 57.1MB in the beginning and 57.1MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:34,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.67ms. Allocated memory is still 96.5MB. Free memory was 61.6MB in the beginning and 64.6MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:31:34,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.07ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 62.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:31:34,379 INFO L158 Benchmark]: Boogie Preprocessor took 54.64ms. Allocated memory is still 96.5MB. Free memory was 62.2MB in the beginning and 60.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:31:34,379 INFO L158 Benchmark]: RCFGBuilder took 634.27ms. Allocated memory is still 96.5MB. Free memory was 60.1MB in the beginning and 65.4MB in the end (delta: -5.4MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2022-02-21 03:31:34,379 INFO L158 Benchmark]: BuchiAutomizer took 29507.18ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 65.4MB in the beginning and 92.7MB in the end (delta: -27.3MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2022-02-21 03:31:34,379 INFO L158 Benchmark]: Witness Printer took 2.04ms. Allocated memory is still 172.0MB. Free memory was 92.7MB in the beginning and 91.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:31:34,381 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 57.1MB in the beginning and 57.1MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.67ms. Allocated memory is still 96.5MB. Free memory was 61.6MB in the beginning and 64.6MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.07ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 62.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.64ms. Allocated memory is still 96.5MB. Free memory was 62.2MB in the beginning and 60.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 634.27ms. Allocated memory is still 96.5MB. Free memory was 60.1MB in the beginning and 65.4MB in the end (delta: -5.4MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 29507.18ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 65.4MB in the beginning and 92.7MB in the end (delta: -27.3MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Witness Printer took 2.04ms. Allocated memory is still 172.0MB. Free memory was 92.7MB in the beginning and 91.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y][y] + 100 and consists of 14 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z][z] + 100 and consists of 13 locations. 12 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.4s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 20.3s. Construction of modules took 2.3s. Büchi inclusion checks took 6.4s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 129 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 296 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 296 mSDsluCounter, 577 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2359 IncrementalHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 219 mSDtfsCounter, 2359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU12 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital332 mio100 ax105 hnf100 lsp89 ukn60 mio100 lsp35 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:31:34,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE