./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:05:01,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:05:01,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:05:01,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:05:01,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:05:01,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:05:01,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:05:01,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:05:01,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:05:01,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:05:01,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:05:01,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:05:01,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:05:01,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:05:01,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:05:01,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:05:01,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:05:01,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:05:01,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:05:01,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:05:01,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:05:01,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:05:01,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:05:01,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:05:01,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:05:01,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:05:01,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:05:01,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:05:01,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:05:01,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:05:01,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:05:01,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:05:01,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:05:01,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:05:01,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:05:01,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:05:01,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:05:01,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:05:01,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:05:01,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:05:01,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:05:01,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-14 23:05:01,086 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:05:01,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:05:01,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:05:01,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:05:01,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:05:01,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:05:01,087 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:05:01,088 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:05:01,088 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:05:01,088 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:05:01,088 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:05:01,088 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:05:01,088 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:05:01,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:05:01,088 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:05:01,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:05:01,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:05:01,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:05:01,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:05:01,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:05:01,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:05:01,089 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:05:01,090 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:05:01,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:05:01,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:05:01,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:05:01,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:05:01,090 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:05:01,090 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:05:01,091 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:05:01,091 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 [2021-12-14 23:05:01,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:05:01,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:05:01,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:05:01,263 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:05:01,264 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:05:01,264 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 [2021-12-14 23:05:01,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803bf0de1/f123c810c1e649f9b3484cc13a1bd44e/FLAGf7ca7fbab [2021-12-14 23:05:01,777 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:05:01,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2021-12-14 23:05:01,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803bf0de1/f123c810c1e649f9b3484cc13a1bd44e/FLAGf7ca7fbab [2021-12-14 23:05:01,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803bf0de1/f123c810c1e649f9b3484cc13a1bd44e [2021-12-14 23:05:01,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:05:01,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:05:01,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:05:01,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:05:01,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:05:01,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:05:01" (1/1) ... [2021-12-14 23:05:01,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b3995d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:01, skipping insertion in model container [2021-12-14 23:05:01,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:05:01" (1/1) ... [2021-12-14 23:05:01,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:05:01,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:05:02,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:05:02,026 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:05:02,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:05:02,063 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:05:02,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02 WrapperNode [2021-12-14 23:05:02,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:05:02,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:05:02,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:05:02,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:05:02,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,097 INFO L137 Inliner]: procedures = 110, calls = 67, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2021-12-14 23:05:02,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:05:02,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:05:02,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:05:02,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:05:02,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:05:02,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:05:02,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:05:02,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:05:02,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (1/1) ... [2021-12-14 23:05:02,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:02,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:02,156 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) [2021-12-14 23:05:02,161 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 [2021-12-14 23:05:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:05:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:05:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:05:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:05:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:05:02,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:05:02,247 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:05:02,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:05:02,449 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:05:02,453 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:05:02,454 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 23:05:02,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:05:02 BoogieIcfgContainer [2021-12-14 23:05:02,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:05:02,455 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:05:02,456 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:05:02,458 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:05:02,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:05:02,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:05:01" (1/3) ... [2021-12-14 23:05:02,459 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c30a88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:05:02, skipping insertion in model container [2021-12-14 23:05:02,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:05:02,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:05:02" (2/3) ... [2021-12-14 23:05:02,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c30a88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:05:02, skipping insertion in model container [2021-12-14 23:05:02,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:05:02,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:05:02" (3/3) ... [2021-12-14 23:05:02,461 INFO L388 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2021-12-14 23:05:02,489 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:05:02,490 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:05:02,490 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:05:02,490 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:05:02,490 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:05:02,490 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:05:02,490 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:05:02,490 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:05:02,499 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) [2021-12-14 23:05:02,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:02,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:02,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:02,514 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] [2021-12-14 23:05:02,514 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:02,514 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:05:02,515 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) [2021-12-14 23:05:02,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:02,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:02,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:02,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] [2021-12-14 23:05:02,519 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:02,524 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 [2021-12-14 23:05:02,525 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 [2021-12-14 23:05:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2021-12-14 23:05:02,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:02,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351658284] [2021-12-14 23:05:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:02,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:02,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:02,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351658284] [2021-12-14 23:05:02,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351658284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:02,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:02,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 23:05:02,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730600601] [2021-12-14 23:05:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:02,799 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2021-12-14 23:05:02,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:02,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638933484] [2021-12-14 23:05:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:02,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:02,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:02,844 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:03,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 23:05:03,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-14 23:05:03,081 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) [2021-12-14 23:05:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:03,370 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2021-12-14 23:05:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 23:05:03,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 112 transitions. [2021-12-14 23:05:03,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:03,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 66 states and 92 transitions. [2021-12-14 23:05:03,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2021-12-14 23:05:03,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-12-14 23:05:03,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2021-12-14 23:05:03,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:03,381 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 92 transitions. [2021-12-14 23:05:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2021-12-14 23:05:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 34. [2021-12-14 23:05:03,397 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) [2021-12-14 23:05:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2021-12-14 23:05:03,398 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2021-12-14 23:05:03,398 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2021-12-14 23:05:03,398 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:05:03,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2021-12-14 23:05:03,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:03,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:03,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:03,400 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] [2021-12-14 23:05:03,400 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:03,400 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 [2021-12-14 23:05:03,400 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 [2021-12-14 23:05:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1775784008, now seen corresponding path program 1 times [2021-12-14 23:05:03,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:03,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265957628] [2021-12-14 23:05:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:03,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:03,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:03,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265957628] [2021-12-14 23:05:03,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265957628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:03,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:03,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:05:03,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599078966] [2021-12-14 23:05:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:03,437 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2021-12-14 23:05:03,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:03,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075758126] [2021-12-14 23:05:03,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:03,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:03,456 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:03,468 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:03,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:03,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:05:03,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:05:03,606 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) [2021-12-14 23:05:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:03,640 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-12-14 23:05:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:05:03,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2021-12-14 23:05:03,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:03,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 45 transitions. [2021-12-14 23:05:03,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-12-14 23:05:03,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-12-14 23:05:03,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 45 transitions. [2021-12-14 23:05:03,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:03,643 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-14 23:05:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 45 transitions. [2021-12-14 23:05:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-14 23:05:03,644 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) [2021-12-14 23:05:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-12-14 23:05:03,645 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-14 23:05:03,645 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-14 23:05:03,645 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:05:03,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2021-12-14 23:05:03,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:03,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:03,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:03,646 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] [2021-12-14 23:05:03,646 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:03,647 INFO L791 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#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; 224#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); 229#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 242#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; 241#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 240#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; 238#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 236#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; 237#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 239#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; 212#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 235#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; 232#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 234#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; 230#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 218#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; 219#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 227#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; 216#L598-4 [2021-12-14 23:05:03,647 INFO L793 eck$LassoCheckResult]: Loop: 216#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; 217#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; 231#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; 216#L598-4 [2021-12-14 23:05:03,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:03,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1239319610, now seen corresponding path program 1 times [2021-12-14 23:05:03,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:03,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920444427] [2021-12-14 23:05:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:03,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:03,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:03,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920444427] [2021-12-14 23:05:03,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920444427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:03,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:03,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 23:05:03,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364751865] [2021-12-14 23:05:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:03,720 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2021-12-14 23:05:03,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:03,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563712934] [2021-12-14 23:05:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:03,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:03,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:03,742 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:03,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 23:05:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 23:05:03,874 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) [2021-12-14 23:05:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:03,988 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2021-12-14 23:05:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:05:03,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2021-12-14 23:05:03,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:03,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2021-12-14 23:05:03,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-12-14 23:05:03,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-12-14 23:05:03,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2021-12-14 23:05:03,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:03,991 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-12-14 23:05:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2021-12-14 23:05:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2021-12-14 23:05:03,993 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) [2021-12-14 23:05:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-12-14 23:05:03,993 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-14 23:05:03,993 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-14 23:05:03,993 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:05:03,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2021-12-14 23:05:03,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:03,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:03,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:03,994 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] [2021-12-14 23:05:03,994 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:03,995 INFO L791 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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; 318#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); 312#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 313#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; 334#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 332#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; 319#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 320#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; 330#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 306#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; 307#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 322#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; 328#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 331#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; 324#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 314#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; 315#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 321#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; 310#L598-4 [2021-12-14 23:05:03,995 INFO L793 eck$LassoCheckResult]: Loop: 310#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; 311#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; 325#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; 310#L598-4 [2021-12-14 23:05:03,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash -652513596, now seen corresponding path program 1 times [2021-12-14 23:05:03,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:03,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120232534] [2021-12-14 23:05:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:03,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:04,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120232534] [2021-12-14 23:05:04,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120232534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:04,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:04,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 23:05:04,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419428774] [2021-12-14 23:05:04,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:04,079 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:04,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2021-12-14 23:05:04,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:04,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075517889] [2021-12-14 23:05:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:04,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:04,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:04,094 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:04,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:04,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 23:05:04,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-14 23:05:04,219 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) [2021-12-14 23:05:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:04,318 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2021-12-14 23:05:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:05:04,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2021-12-14 23:05:04,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:04,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2021-12-14 23:05:04,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-14 23:05:04,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-14 23:05:04,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2021-12-14 23:05:04,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:04,321 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2021-12-14 23:05:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2021-12-14 23:05:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-12-14 23:05:04,322 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) [2021-12-14 23:05:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-12-14 23:05:04,323 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-14 23:05:04,323 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-14 23:05:04,323 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:05:04,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-12-14 23:05:04,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:04,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:04,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:04,323 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] [2021-12-14 23:05:04,323 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:04,324 INFO L791 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 396#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; 410#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); 406#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 407#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; 418#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 420#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; 411#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 412#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; 426#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 425#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; 400#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 424#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; 419#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 423#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; 417#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 404#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; 405#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 413#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; 397#L598-4 [2021-12-14 23:05:04,324 INFO L793 eck$LassoCheckResult]: Loop: 397#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; 398#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; 416#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; 397#L598-4 [2021-12-14 23:05:04,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:04,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1353578174, now seen corresponding path program 1 times [2021-12-14 23:05:04,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:04,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423950013] [2021-12-14 23:05:04,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:04,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:04,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:04,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423950013] [2021-12-14 23:05:04,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423950013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:04,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:04,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 23:05:04,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042074121] [2021-12-14 23:05:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:04,371 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:04,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:04,371 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2021-12-14 23:05:04,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:04,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605541321] [2021-12-14 23:05:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:04,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:04,379 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:04,386 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:04,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:04,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:05:04,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:05:04,517 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) [2021-12-14 23:05:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:04,618 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-14 23:05:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:05:04,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-12-14 23:05:04,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:04,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2021-12-14 23:05:04,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-14 23:05:04,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-14 23:05:04,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2021-12-14 23:05:04,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:04,621 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2021-12-14 23:05:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2021-12-14 23:05:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-12-14 23:05:04,622 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) [2021-12-14 23:05:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2021-12-14 23:05:04,623 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-12-14 23:05:04,623 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-12-14 23:05:04,623 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:05:04,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2021-12-14 23:05:04,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:04,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:04,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:04,624 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] [2021-12-14 23:05:04,624 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:04,624 INFO L791 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 485#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; 500#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); 504#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 515#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; 514#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 512#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; 513#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 517#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; 516#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 486#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; 487#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 511#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; 507#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 510#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; 505#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 492#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; 493#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 501#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; 490#L598-4 [2021-12-14 23:05:04,624 INFO L793 eck$LassoCheckResult]: Loop: 490#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; 491#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; 506#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; 490#L598-4 [2021-12-14 23:05:04,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:04,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2033636544, now seen corresponding path program 1 times [2021-12-14 23:05:04,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:04,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953494052] [2021-12-14 23:05:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:04,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:04,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:04,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953494052] [2021-12-14 23:05:04,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953494052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:04,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:04,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 23:05:04,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583604823] [2021-12-14 23:05:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:04,673 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2021-12-14 23:05:04,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:04,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394190529] [2021-12-14 23:05:04,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:04,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:04,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:04,685 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:04,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:04,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 23:05:04,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 23:05:04,861 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) [2021-12-14 23:05:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:04,961 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2021-12-14 23:05:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 23:05:04,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 67 transitions. [2021-12-14 23:05:04,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:04,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 67 transitions. [2021-12-14 23:05:04,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-12-14 23:05:04,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2021-12-14 23:05:04,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2021-12-14 23:05:04,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:04,971 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2021-12-14 23:05:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2021-12-14 23:05:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2021-12-14 23:05:04,975 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) [2021-12-14 23:05:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-12-14 23:05:04,976 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-12-14 23:05:04,976 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-12-14 23:05:04,976 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:05:04,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2021-12-14 23:05:04,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:04,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:04,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:04,977 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] [2021-12-14 23:05:04,977 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:04,977 INFO L791 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 582#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; 595#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); 600#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 604#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; 593#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 594#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; 596#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 597#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; 611#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 583#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; 584#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 599#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; 585#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 586#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; 602#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 591#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; 592#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 598#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; 587#L598-4 [2021-12-14 23:05:04,978 INFO L793 eck$LassoCheckResult]: Loop: 587#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; 588#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; 603#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; 587#L598-4 [2021-12-14 23:05:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash 486323390, now seen corresponding path program 1 times [2021-12-14 23:05:04,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:04,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232960608] [2021-12-14 23:05:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:04,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:05,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:05,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232960608] [2021-12-14 23:05:05,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232960608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:05,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:05,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 23:05:05,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894759958] [2021-12-14 23:05:05,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:05,086 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2021-12-14 23:05:05,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:05,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371650883] [2021-12-14 23:05:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:05,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,092 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,098 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:05,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 23:05:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-14 23:05:05,273 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) [2021-12-14 23:05:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:05,377 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-12-14 23:05:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 23:05:05,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2021-12-14 23:05:05,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:05,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 59 transitions. [2021-12-14 23:05:05,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2021-12-14 23:05:05,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-12-14 23:05:05,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 59 transitions. [2021-12-14 23:05:05,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:05,381 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2021-12-14 23:05:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 59 transitions. [2021-12-14 23:05:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2021-12-14 23:05:05,389 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) [2021-12-14 23:05:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2021-12-14 23:05:05,392 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2021-12-14 23:05:05,392 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2021-12-14 23:05:05,392 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:05:05,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2021-12-14 23:05:05,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:05,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:05,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:05,394 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] [2021-12-14 23:05:05,394 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:05,394 INFO L791 eck$LassoCheckResult]: Stem: 681#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 682#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; 697#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); 700#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 720#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; 719#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 718#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; 717#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 716#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; 715#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 683#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; 684#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 699#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; 685#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 686#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; 701#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 689#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; 690#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 698#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; 687#L598-4 [2021-12-14 23:05:05,394 INFO L793 eck$LassoCheckResult]: Loop: 687#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; 688#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; 702#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; 687#L598-4 [2021-12-14 23:05:05,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2021-12-14 23:05:05,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:05,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095562617] [2021-12-14 23:05:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:05,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:05,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:05,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095562617] [2021-12-14 23:05:05,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095562617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:05,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:05,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:05:05,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177396696] [2021-12-14 23:05:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:05,455 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:05,455 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2021-12-14 23:05:05,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:05,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965131316] [2021-12-14 23:05:05,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:05,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,462 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,472 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:05,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:05,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:05:05,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:05:05,624 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) [2021-12-14 23:05:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:05,676 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-14 23:05:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:05:05,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2021-12-14 23:05:05,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:05,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 54 transitions. [2021-12-14 23:05:05,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-14 23:05:05,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-14 23:05:05,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2021-12-14 23:05:05,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:05,683 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2021-12-14 23:05:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2021-12-14 23:05:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2021-12-14 23:05:05,684 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) [2021-12-14 23:05:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2021-12-14 23:05:05,685 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2021-12-14 23:05:05,685 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2021-12-14 23:05:05,685 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-14 23:05:05,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2021-12-14 23:05:05,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:05,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:05,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:05,686 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] [2021-12-14 23:05:05,686 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:05,686 INFO L791 eck$LassoCheckResult]: Stem: 774#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 775#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; 788#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); 782#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 783#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; 786#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 787#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; 789#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 790#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; 800#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 778#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; 779#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 793#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; 780#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 781#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; 797#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 784#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; 785#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 794#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; 776#L598-4 [2021-12-14 23:05:05,686 INFO L793 eck$LassoCheckResult]: Loop: 776#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; 777#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; 796#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; 776#L598-4 [2021-12-14 23:05:05,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:05,688 INFO L85 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2021-12-14 23:05:05,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:05,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17937552] [2021-12-14 23:05:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:05,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,761 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2021-12-14 23:05:05,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:05,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99912701] [2021-12-14 23:05:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:05,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,766 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,772 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:05,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2021-12-14 23:05:05,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:05,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210783218] [2021-12-14 23:05:05,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:05,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:05,810 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:10,699 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:05:10,700 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:05:10,700 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:05:10,700 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:05:10,700 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:05:10,700 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:10,700 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:05:10,700 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:05:10,700 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration9_Lasso [2021-12-14 23:05:10,700 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:05:10,700 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:05:10,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:10,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:11,599 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:05:11,602 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:05:11,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,605 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) [2021-12-14 23:05:11,605 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 [2021-12-14 23:05:11,607 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 [2021-12-14 23:05:11,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:11,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:11,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:11,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:11,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:11,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:11,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:11,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:11,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-14 23:05:11,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,649 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) [2021-12-14 23:05:11,650 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 [2021-12-14 23:05:11,654 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 [2021-12-14 23:05:11,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:11,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:11,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:11,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:11,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:11,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:11,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:11,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:11,687 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 [2021-12-14 23:05:11,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,696 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) [2021-12-14 23:05:11,728 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 [2021-12-14 23:05:11,729 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 [2021-12-14 23:05:11,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:11,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:11,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:11,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:11,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:11,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:11,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:11,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:11,762 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 [2021-12-14 23:05:11,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,763 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) [2021-12-14 23:05:11,778 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 [2021-12-14 23:05:11,779 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 [2021-12-14 23:05:11,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:11,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:11,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:11,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:11,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:11,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:11,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:11,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:11,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:11,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,803 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) [2021-12-14 23:05:11,804 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 [2021-12-14 23:05:11,805 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 [2021-12-14 23:05:11,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:11,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:11,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:11,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:11,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:11,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:11,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:11,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:11,843 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 [2021-12-14 23:05:11,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,844 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) [2021-12-14 23:05:11,845 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 [2021-12-14 23:05:11,847 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 [2021-12-14 23:05:11,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:11,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:11,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:11,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:11,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:11,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:11,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:11,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:11,869 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 [2021-12-14 23:05:11,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,870 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) [2021-12-14 23:05:11,871 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 [2021-12-14 23:05:11,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:05:11,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:11,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:11,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:11,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:11,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:11,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:11,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:11,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:11,898 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 [2021-12-14 23:05:11,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,899 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) [2021-12-14 23:05:11,904 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 [2021-12-14 23:05:11,906 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 [2021-12-14 23:05:11,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:11,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:11,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:11,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:11,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:11,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:11,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:11,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:11,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,949 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) [2021-12-14 23:05:11,950 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 [2021-12-14 23:05:11,951 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 [2021-12-14 23:05:11,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:11,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:11,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:11,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:11,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:11,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:11,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:11,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:11,994 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 [2021-12-14 23:05:11,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:11,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:11,995 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) [2021-12-14 23:05:11,998 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 [2021-12-14 23:05:12,003 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 [2021-12-14 23:05:12,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,034 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 [2021-12-14 23:05:12,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,036 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) [2021-12-14 23:05:12,037 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 [2021-12-14 23:05:12,038 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 [2021-12-14 23:05:12,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,076 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 [2021-12-14 23:05:12,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,078 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) [2021-12-14 23:05:12,078 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 [2021-12-14 23:05:12,080 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 [2021-12-14 23:05:12,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,103 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 [2021-12-14 23:05:12,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,104 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) [2021-12-14 23:05:12,105 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 [2021-12-14 23:05:12,106 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 [2021-12-14 23:05:12,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,144 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 [2021-12-14 23:05:12,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,145 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) [2021-12-14 23:05:12,146 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 [2021-12-14 23:05:12,147 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 [2021-12-14 23:05:12,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,180 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 [2021-12-14 23:05:12,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,181 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) [2021-12-14 23:05:12,182 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 [2021-12-14 23:05:12,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:05:12,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,204 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 [2021-12-14 23:05:12,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,206 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) [2021-12-14 23:05:12,206 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 [2021-12-14 23:05:12,208 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 [2021-12-14 23:05:12,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:12,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:12,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:12,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,233 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) [2021-12-14 23:05:12,233 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 [2021-12-14 23:05:12,235 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 [2021-12-14 23:05:12,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,267 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 [2021-12-14 23:05:12,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,269 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) [2021-12-14 23:05:12,270 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 [2021-12-14 23:05:12,270 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 [2021-12-14 23:05:12,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:12,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,294 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) [2021-12-14 23:05:12,297 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 [2021-12-14 23:05:12,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,315 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 [2021-12-14 23:05:12,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,336 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 [2021-12-14 23:05:12,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,338 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) [2021-12-14 23:05:12,339 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 [2021-12-14 23:05:12,340 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 [2021-12-14 23:05:12,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,363 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 [2021-12-14 23:05:12,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,365 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) [2021-12-14 23:05:12,366 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 [2021-12-14 23:05:12,367 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 [2021-12-14 23:05:12,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,405 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 [2021-12-14 23:05:12,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,406 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) [2021-12-14 23:05:12,407 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 [2021-12-14 23:05:12,408 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 [2021-12-14 23:05:12,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:12,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,430 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) [2021-12-14 23:05:12,432 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 [2021-12-14 23:05:12,432 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 [2021-12-14 23:05:12,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,454 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 [2021-12-14 23:05:12,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,456 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) [2021-12-14 23:05:12,457 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 [2021-12-14 23:05:12,458 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 [2021-12-14 23:05:12,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:12,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,491 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) [2021-12-14 23:05:12,494 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 [2021-12-14 23:05:12,494 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 [2021-12-14 23:05:12,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:12,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,531 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) [2021-12-14 23:05:12,532 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 [2021-12-14 23:05:12,533 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 [2021-12-14 23:05:12,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,555 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 [2021-12-14 23:05:12,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,556 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) [2021-12-14 23:05:12,557 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 [2021-12-14 23:05:12,559 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 [2021-12-14 23:05:12,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:12,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,599 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) [2021-12-14 23:05:12,600 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 [2021-12-14 23:05:12,601 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 [2021-12-14 23:05:12,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,624 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 [2021-12-14 23:05:12,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,625 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) [2021-12-14 23:05:12,626 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 [2021-12-14 23:05:12,627 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 [2021-12-14 23:05:12,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:12,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:12,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,664 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 [2021-12-14 23:05:12,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,666 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) [2021-12-14 23:05:12,667 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 [2021-12-14 23:05:12,668 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 [2021-12-14 23:05:12,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:12,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,705 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) [2021-12-14 23:05:12,706 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 [2021-12-14 23:05:12,707 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 [2021-12-14 23:05:12,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:05:12,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:05:12,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:05:12,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-14 23:05:12,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,732 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) [2021-12-14 23:05:12,733 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 [2021-12-14 23:05:12,734 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 [2021-12-14 23:05:12,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:12,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:12,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,759 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 [2021-12-14 23:05:12,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,762 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) [2021-12-14 23:05:12,762 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 [2021-12-14 23:05:12,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:05:12,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:12,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:12,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,795 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 [2021-12-14 23:05:12,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,798 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) [2021-12-14 23:05:12,799 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 [2021-12-14 23:05:12,799 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 [2021-12-14 23:05:12,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:12,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:12,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-14 23:05:12,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,842 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) [2021-12-14 23:05:12,843 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 [2021-12-14 23:05:12,844 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 [2021-12-14 23:05:12,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:12,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:12,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,884 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 [2021-12-14 23:05:12,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,886 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) [2021-12-14 23:05:12,886 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 [2021-12-14 23:05:12,888 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 [2021-12-14 23:05:12,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:12,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:12,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:12,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-14 23:05:12,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:12,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:12,939 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) [2021-12-14 23:05:12,940 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 [2021-12-14 23:05:12,941 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 [2021-12-14 23:05:12,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:12,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:12,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:12,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:12,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:12,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:12,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:13,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:13,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:13,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:13,009 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) [2021-12-14 23:05:13,010 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 [2021-12-14 23:05:13,011 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 [2021-12-14 23:05:13,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:13,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:13,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:13,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:13,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:13,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:13,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:13,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:13,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:13,053 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) [2021-12-14 23:05:13,053 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 [2021-12-14 23:05:13,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 [2021-12-14 23:05:13,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:13,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:13,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:13,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:13,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:13,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:13,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:13,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:13,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:13,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:13,113 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) [2021-12-14 23:05:13,115 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 [2021-12-14 23:05:13,115 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 [2021-12-14 23:05:13,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:13,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:13,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:13,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:13,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:13,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:13,139 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:05:13,146 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-14 23:05:13,146 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-14 23:05:13,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:13,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:13,148 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) [2021-12-14 23:05:13,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:05:13,189 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 [2021-12-14 23:05:13,201 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-14 23:05:13,201 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:05:13,201 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] [2021-12-14 23:05:13,216 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 [2021-12-14 23:05:13,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:13,341 INFO L297 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2021-12-14 23:05:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:13,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-14 23:05:13,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:05:13,483 INFO L388 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 [2021-12-14 23:05:13,563 INFO L388 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 [2021-12-14 23:05:13,613 INFO L388 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 [2021-12-14 23:05:13,664 INFO L388 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 [2021-12-14 23:05:13,711 INFO L388 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 [2021-12-14 23:05:13,763 INFO L388 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 [2021-12-14 23:05:13,810 INFO L388 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 [2021-12-14 23:05:13,862 INFO L388 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 [2021-12-14 23:05:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:13,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 23:05:13,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:05:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:13,993 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 [2021-12-14 23:05:13,994 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) [2021-12-14 23:05:14,306 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. [2021-12-14 23:05:14,306 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 [2021-12-14 23:05:14,307 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) [2021-12-14 23:05:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2021-12-14 23:05:14,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 3 letters. [2021-12-14 23:05:14,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:05:14,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-14 23:05:14,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:05:14,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 6 letters. [2021-12-14 23:05:14,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:05:14,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2021-12-14 23:05:14,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:05:14,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 33 states and 42 transitions. [2021-12-14 23:05:14,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-14 23:05:14,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-14 23:05:14,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2021-12-14 23:05:14,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:14,310 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2021-12-14 23:05:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2021-12-14 23:05:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-12-14 23:05:14,311 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) [2021-12-14 23:05:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-14 23:05:14,311 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-14 23:05:14,311 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-14 23:05:14,311 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-14 23:05:14,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2021-12-14 23:05:14,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:14,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:14,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:14,312 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] [2021-12-14 23:05:14,312 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:14,312 INFO L791 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1161#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; 1178#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); 1172#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1173#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; 1174#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1175#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; 1176#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1177#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; 1185#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1164#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; 1165#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1180#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; 1167#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1168#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; 1184#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1169#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; 1170#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1181#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; 1162#L598-4 [2021-12-14 23:05:14,312 INFO L793 eck$LassoCheckResult]: Loop: 1162#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; 1163#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; 1182#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; 1162#L598-4 [2021-12-14 23:05:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash -492624188, now seen corresponding path program 1 times [2021-12-14 23:05:14,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:14,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207128358] [2021-12-14 23:05:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:14,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:14,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:14,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207128358] [2021-12-14 23:05:14,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207128358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:14,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:14,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 23:05:14,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510939496] [2021-12-14 23:05:14,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:14,414 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2021-12-14 23:05:14,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:14,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41036628] [2021-12-14 23:05:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:14,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:14,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:14,428 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:14,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 23:05:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 23:05:14,550 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) [2021-12-14 23:05:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:14,648 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2021-12-14 23:05:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 23:05:14,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2021-12-14 23:05:14,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:14,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2021-12-14 23:05:14,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-12-14 23:05:14,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-12-14 23:05:14,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2021-12-14 23:05:14,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:14,649 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2021-12-14 23:05:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2021-12-14 23:05:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2021-12-14 23:05:14,650 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) [2021-12-14 23:05:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-12-14 23:05:14,650 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-14 23:05:14,650 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-14 23:05:14,650 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-14 23:05:14,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2021-12-14 23:05:14,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:14,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:14,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:14,651 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] [2021-12-14 23:05:14,651 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:14,651 INFO L791 eck$LassoCheckResult]: Stem: 1243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1244#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; 1258#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); 1254#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1255#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; 1256#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1257#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; 1259#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1260#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; 1267#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1249#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; 1250#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1263#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; 1266#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1268#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; 1264#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1251#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; 1252#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1262#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; 1247#L598-4 [2021-12-14 23:05:14,651 INFO L793 eck$LassoCheckResult]: Loop: 1247#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; 1248#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; 1265#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; 1247#L598-4 [2021-12-14 23:05:14,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1587573180, now seen corresponding path program 1 times [2021-12-14 23:05:14,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:14,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077978935] [2021-12-14 23:05:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:14,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:14,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:14,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077978935] [2021-12-14 23:05:14,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077978935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:14,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:14,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 23:05:14,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997388964] [2021-12-14 23:05:14,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:14,748 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2021-12-14 23:05:14,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34427517] [2021-12-14 23:05:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:14,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:14,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:14,767 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:14,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:14,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 23:05:14,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 23:05:14,963 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) [2021-12-14 23:05:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:15,111 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-12-14 23:05:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 23:05:15,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2021-12-14 23:05:15,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:15,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2021-12-14 23:05:15,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-14 23:05:15,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-14 23:05:15,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2021-12-14 23:05:15,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:15,114 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-12-14 23:05:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2021-12-14 23:05:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2021-12-14 23:05:15,118 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) [2021-12-14 23:05:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-14 23:05:15,118 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-14 23:05:15,118 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-14 23:05:15,118 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-14 23:05:15,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2021-12-14 23:05:15,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:15,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:15,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:15,119 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] [2021-12-14 23:05:15,119 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:15,120 INFO L791 eck$LassoCheckResult]: Stem: 1321#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1322#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; 1336#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); 1329#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1330#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; 1334#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1335#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; 1337#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1338#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; 1344#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1323#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; 1324#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1340#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; 1325#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1326#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; 1342#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1331#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; 1332#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1341#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; 1327#L598-4 [2021-12-14 23:05:15,120 INFO L793 eck$LassoCheckResult]: Loop: 1327#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; 1328#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; 1343#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; 1327#L598-4 [2021-12-14 23:05:15,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash 189281224, now seen corresponding path program 1 times [2021-12-14 23:05:15,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:15,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114592765] [2021-12-14 23:05:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:15,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:15,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:15,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114592765] [2021-12-14 23:05:15,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114592765] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:15,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:15,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 23:05:15,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718721774] [2021-12-14 23:05:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:15,272 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2021-12-14 23:05:15,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:15,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871018176] [2021-12-14 23:05:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:15,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:15,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:15,302 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:15,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:15,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 23:05:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-12-14 23:05:15,469 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) [2021-12-14 23:05:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:15,595 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-12-14 23:05:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 23:05:15,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2021-12-14 23:05:15,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:15,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2021-12-14 23:05:15,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-14 23:05:15,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-14 23:05:15,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2021-12-14 23:05:15,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:15,598 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-14 23:05:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2021-12-14 23:05:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2021-12-14 23:05:15,620 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) [2021-12-14 23:05:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-14 23:05:15,621 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-14 23:05:15,621 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-14 23:05:15,621 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-14 23:05:15,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2021-12-14 23:05:15,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:15,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:15,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:15,624 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] [2021-12-14 23:05:15,624 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:15,625 INFO L791 eck$LassoCheckResult]: Stem: 1390#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1391#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; 1404#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); 1398#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1399#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; 1402#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1403#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; 1405#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1406#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; 1411#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1392#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; 1393#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1408#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; 1394#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1395#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; 1409#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1400#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; 1401#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1407#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; 1396#L598-4 [2021-12-14 23:05:15,625 INFO L793 eck$LassoCheckResult]: Loop: 1396#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; 1397#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; 1410#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; 1396#L598-4 [2021-12-14 23:05:15,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2021-12-14 23:05:15,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:15,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513051196] [2021-12-14 23:05:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:15,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:15,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:15,646 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:15,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:15,646 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2021-12-14 23:05:15,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:15,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290160805] [2021-12-14 23:05:15,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:15,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:15,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:15,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2021-12-14 23:05:15,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:15,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677862729] [2021-12-14 23:05:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:15,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:15,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:15,688 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:20,320 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:05:20,320 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:05:20,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:05:20,320 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:05:20,320 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:05:20,320 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:20,320 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:05:20,320 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:05:20,320 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration13_Lasso [2021-12-14 23:05:20,320 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:05:20,320 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:05:20,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:20,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:05:21,099 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:05:21,099 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:05:21,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,100 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) [2021-12-14 23:05:21,101 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 [2021-12-14 23:05:21,102 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 [2021-12-14 23:05:21,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:21,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-14 23:05:21,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,141 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) [2021-12-14 23:05:21,143 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 [2021-12-14 23:05:21,144 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 [2021-12-14 23:05:21,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:21,167 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 [2021-12-14 23:05:21,168 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,169 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) [2021-12-14 23:05:21,169 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 [2021-12-14 23:05:21,172 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 [2021-12-14 23:05:21,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:21,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:21,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,222 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) [2021-12-14 23:05:21,223 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 [2021-12-14 23:05:21,224 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 [2021-12-14 23:05:21,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:21,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:21,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,252 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) [2021-12-14 23:05:21,252 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 [2021-12-14 23:05:21,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:05:21,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:21,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-14 23:05:21,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,279 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) [2021-12-14 23:05:21,279 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 [2021-12-14 23:05:21,280 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 [2021-12-14 23:05:21,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:21,322 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 [2021-12-14 23:05:21,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,323 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) [2021-12-14 23:05:21,324 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 [2021-12-14 23:05:21,325 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 [2021-12-14 23:05:21,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:21,363 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 [2021-12-14 23:05:21,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,364 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) [2021-12-14 23:05:21,376 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 [2021-12-14 23:05:21,377 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 [2021-12-14 23:05:21,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:21,416 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 [2021-12-14 23:05:21,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,418 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) [2021-12-14 23:05:21,419 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 [2021-12-14 23:05:21,420 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 [2021-12-14 23:05:21,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:05:21,458 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 [2021-12-14 23:05:21,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,460 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) [2021-12-14 23:05:21,461 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 [2021-12-14 23:05:21,461 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 [2021-12-14 23:05:21,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:05:21,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:05:21,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:05:21,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:05:21,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:05:21,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:05:21,499 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:05:21,505 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-14 23:05:21,505 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-14 23:05:21,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:05:21,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:21,506 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) [2021-12-14 23:05:21,520 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 [2021-12-14 23:05:21,563 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:05:21,584 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-14 23:05:21,584 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:05:21,584 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] [2021-12-14 23:05:21,600 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 [2021-12-14 23:05:21,715 INFO L297 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2021-12-14 23:05:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:21,770 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 [2021-12-14 23:05:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:21,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-14 23:05:21,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:05:21,819 INFO L388 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 [2021-12-14 23:05:21,850 INFO L388 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 [2021-12-14 23:05:21,911 INFO L388 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 [2021-12-14 23:05:21,972 INFO L388 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 [2021-12-14 23:05:22,030 INFO L388 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 [2021-12-14 23:05:22,081 INFO L388 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 [2021-12-14 23:05:22,123 INFO L388 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 [2021-12-14 23:05:22,180 INFO L388 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 [2021-12-14 23:05:22,235 INFO L388 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 [2021-12-14 23:05:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:22,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-14 23:05:22,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:05:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:22,358 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 [2021-12-14 23:05:22,358 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) [2021-12-14 23:05:22,487 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. [2021-12-14 23:05:22,487 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 [2021-12-14 23:05:22,488 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) [2021-12-14 23:05:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2021-12-14 23:05:22,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 3 letters. [2021-12-14 23:05:22,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:05:22,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-14 23:05:22,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:05:22,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 6 letters. [2021-12-14 23:05:22,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:05:22,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2021-12-14 23:05:22,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:22,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 23 transitions. [2021-12-14 23:05:22,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-14 23:05:22,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-14 23:05:22,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2021-12-14 23:05:22,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:22,490 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-14 23:05:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2021-12-14 23:05:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-14 23:05:22,490 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) [2021-12-14 23:05:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-12-14 23:05:22,490 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-14 23:05:22,490 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-14 23:05:22,490 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-14 23:05:22,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2021-12-14 23:05:22,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:22,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:22,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:22,491 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] [2021-12-14 23:05:22,491 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:22,491 INFO L791 eck$LassoCheckResult]: Stem: 1720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1721#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; 1734#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); 1728#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1729#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; 1732#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1733#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; 1735#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1736#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; 1741#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1724#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; 1725#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1738#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; 1726#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1727#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; 1740#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1730#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; 1731#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1737#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; 1722#L598-4 [2021-12-14 23:05:22,491 INFO L793 eck$LassoCheckResult]: Loop: 1722#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; 1723#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; 1739#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; 1722#L598-4 [2021-12-14 23:05:22,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2021-12-14 23:05:22,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:22,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358165911] [2021-12-14 23:05:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:22,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:05:22,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:22,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358165911] [2021-12-14 23:05:22,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358165911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:05:22,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:05:22,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 23:05:22,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979961162] [2021-12-14 23:05:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:05:22,691 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 14 times [2021-12-14 23:05:22,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:22,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833151626] [2021-12-14 23:05:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:22,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:22,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:22,703 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:22,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:22,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 23:05:22,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-12-14 23:05:22,816 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) [2021-12-14 23:05:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:22,864 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2021-12-14 23:05:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 23:05:22,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2021-12-14 23:05:22,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:05:22,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2021-12-14 23:05:22,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-14 23:05:22,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-14 23:05:22,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-14 23:05:22,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:05:22,865 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:05:22,865 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:05:22,865 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:05:22,865 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-14 23:05:22,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-14 23:05:22,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:05:22,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-14 23:05:22,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:05:22 BoogieIcfgContainer [2021-12-14 23:05:22,870 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:05:22,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:05:22,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:05:22,870 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:05:22,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:05:02" (3/4) ... [2021-12-14 23:05:22,872 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 23:05:22,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:05:22,873 INFO L158 Benchmark]: Toolchain (without parser) took 21073.19ms. Allocated memory was 104.9MB in the beginning and 211.8MB in the end (delta: 107.0MB). Free memory was 78.5MB in the beginning and 151.2MB in the end (delta: -72.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2021-12-14 23:05:22,873 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:05:22,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.31ms. Allocated memory was 104.9MB in the beginning and 146.8MB in the end (delta: 41.9MB). Free memory was 78.3MB in the beginning and 117.1MB in the end (delta: -38.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 23:05:22,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.32ms. Allocated memory is still 146.8MB. Free memory was 117.1MB in the beginning and 114.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:05:22,873 INFO L158 Benchmark]: Boogie Preprocessor took 18.42ms. Allocated memory is still 146.8MB. Free memory was 114.9MB in the beginning and 113.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:05:22,873 INFO L158 Benchmark]: RCFGBuilder took 337.93ms. Allocated memory is still 146.8MB. Free memory was 113.3MB in the beginning and 97.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-14 23:05:22,874 INFO L158 Benchmark]: BuchiAutomizer took 20414.32ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 97.6MB in the beginning and 152.2MB in the end (delta: -54.6MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2021-12-14 23:05:22,874 INFO L158 Benchmark]: Witness Printer took 2.16ms. Allocated memory is still 211.8MB. Free memory was 152.2MB in the beginning and 151.2MB in the end (delta: 988.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:05:22,875 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.31ms. Allocated memory was 104.9MB in the beginning and 146.8MB in the end (delta: 41.9MB). Free memory was 78.3MB in the beginning and 117.1MB in the end (delta: -38.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.32ms. Allocated memory is still 146.8MB. Free memory was 117.1MB in the beginning and 114.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.42ms. Allocated memory is still 146.8MB. Free memory was 114.9MB in the beginning and 113.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.93ms. Allocated memory is still 146.8MB. Free memory was 113.3MB in the beginning and 97.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 20414.32ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 97.6MB in the beginning and 152.2MB in the end (delta: -54.6MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Witness Printer took 2.16ms. Allocated memory is still 211.8MB. Free memory was 152.2MB in the beginning and 151.2MB in the end (delta: 988.4kB). There was no memory consumed. 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 20.3s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 17.1s. Construction of modules took 1.1s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s 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, 303 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 581 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2394 IncrementalHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 219 mSDtfsCounter, 2394 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: 34ms 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! [2021-12-14 23:05:22,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE