./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 20ed64ec 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 7ed84bee4308b8cf5be51a33ec471886cd45cc40 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:15:44,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:15:44,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:15:44,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:15:44,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:15:44,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:15:44,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:15:44,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:15:44,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:15:44,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:15:44,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:15:44,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:15:44,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:15:44,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:15:44,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:15:44,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:15:44,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:15:44,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:15:44,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:15:44,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:15:44,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:15:44,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:15:44,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:15:44,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:15:44,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:15:44,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:15:44,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:15:44,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:15:44,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:15:44,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:15:44,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:15:44,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:15:44,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:15:44,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:15:44,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:15:44,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:15:44,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:15:44,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:15:44,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:15:44,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:15:44,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:15:45,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-27 14:15:45,037 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:15:45,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:15:45,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:15:45,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:15:45,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:15:45,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:15:45,041 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:15:45,041 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:15:45,042 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:15:45,042 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:15:45,043 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:15:45,043 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:15:45,043 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:15:45,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:15:45,043 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:15:45,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:15:45,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:15:45,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:15:45,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:15:45,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:15:45,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:15:45,045 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:15:45,045 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:15:45,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:15:45,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:15:45,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:15:45,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:15:45,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:15:45,046 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:15:45,047 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:15:45,047 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 -> 7ed84bee4308b8cf5be51a33ec471886cd45cc40 [2021-08-27 14:15:45,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:15:45,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:15:45,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:15:45,383 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:15:45,385 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:15:45,386 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-08-27 14:15:45,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fa52f27/b1704d38475742d8b96633760bf7bbc0/FLAG6f2e56870 [2021-08-27 14:15:45,836 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:15:45,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2021-08-27 14:15:45,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fa52f27/b1704d38475742d8b96633760bf7bbc0/FLAG6f2e56870 [2021-08-27 14:15:46,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fa52f27/b1704d38475742d8b96633760bf7bbc0 [2021-08-27 14:15:46,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:15:46,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:15:46,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:15:46,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:15:46,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:15:46,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2365ca08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46, skipping insertion in model container [2021-08-27 14:15:46,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:15:46,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:15:46,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:15:46,507 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:15:46,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:15:46,598 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:15:46,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46 WrapperNode [2021-08-27 14:15:46,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:15:46,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:15:46,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:15:46,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:15:46,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:15:46,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:15:46,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:15:46,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:15:46,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:15:46,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:15:46,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:15:46,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:15:46,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (1/1) ... [2021-08-27 14:15:46,668 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:46,686 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-08-27 14:15:46,689 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-08-27 14:15:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 14:15:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 14:15:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:15:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 14:15:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:15:46,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:15:47,169 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:15:47,171 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 14:15:47,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:15:47 BoogieIcfgContainer [2021-08-27 14:15:47,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:15:47,174 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:15:47,174 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:15:47,177 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:15:47,177 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:15:47,178 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:15:46" (1/3) ... [2021-08-27 14:15:47,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46f4b78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:15:47, skipping insertion in model container [2021-08-27 14:15:47,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:15:47,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:15:46" (2/3) ... [2021-08-27 14:15:47,180 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46f4b78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:15:47, skipping insertion in model container [2021-08-27 14:15:47,180 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:15:47,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:15:47" (3/3) ... [2021-08-27 14:15:47,182 INFO L389 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2021-08-27 14:15:47,227 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:15:47,227 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:15:47,227 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:15:47,227 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:15:47,227 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:15:47,228 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:15:47,228 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:15:47,228 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:15:47,240 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-08-27 14:15:47,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:47,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:47,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:47,268 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-08-27 14:15:47,268 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:47,269 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:15:47,269 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-08-27 14:15:47,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:47,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:47,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:47,275 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-08-27 14:15:47,275 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:47,281 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 10#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 4#L553-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 23#L558true assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 19#L558-2true call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 24#L563true assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 20#L563-2true call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 27#L568true assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 26#L568-2true call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 15#L573true assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 8#L573-2true call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L578true assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 16#L578-2true call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 21#L583true assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 25#L583-2true call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 18#L588true assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 7#L588-2true call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L593true assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 17#L598-4true [2021-08-27 14:15:47,281 INFO L793 eck$LassoCheckResult]: Loop: 17#L598-4true call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 13#L598true assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 22#L598-2true assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 17#L598-4true [2021-08-27 14:15:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2021-08-27 14:15:47,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:47,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667448637] [2021-08-27 14:15:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:47,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:47,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:47,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667448637] [2021-08-27 14:15:47,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667448637] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:47,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:47,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 14:15:47,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527004357] [2021-08-27 14:15:47,897 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2021-08-27 14:15:47,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:47,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383014823] [2021-08-27 14:15:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:47,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:47,966 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:48,017 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:48,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:48,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 14:15:48,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-27 14:15:48,284 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 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-08-27 14:15:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:48,583 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2021-08-27 14:15:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 14:15:48,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 81 transitions. [2021-08-27 14:15:48,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:48,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 49 states and 65 transitions. [2021-08-27 14:15:48,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2021-08-27 14:15:48,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2021-08-27 14:15:48,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2021-08-27 14:15:48,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:48,603 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2021-08-27 14:15:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2021-08-27 14:15:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2021-08-27 14:15:48,627 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-08-27 14:15:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-08-27 14:15:48,632 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-08-27 14:15:48,633 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-08-27 14:15:48,633 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:15:48,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2021-08-27 14:15:48,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:48,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:48,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:48,638 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-08-27 14:15:48,638 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:48,639 INFO L791 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 112#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 125#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 131#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 135#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 123#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 124#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 126#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 127#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 144#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 113#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 114#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 136#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 115#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 116#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 133#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 121#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 122#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 128#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 117#L598-4 [2021-08-27 14:15:48,639 INFO L793 eck$LassoCheckResult]: Loop: 117#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 118#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 134#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 117#L598-4 [2021-08-27 14:15:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1775784008, now seen corresponding path program 1 times [2021-08-27 14:15:48,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:48,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251655904] [2021-08-27 14:15:48,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:48,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:48,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:48,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251655904] [2021-08-27 14:15:48,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251655904] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:48,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:48,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:15:48,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646737166] [2021-08-27 14:15:48,707 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2021-08-27 14:15:48,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:48,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915950557] [2021-08-27 14:15:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:48,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:48,745 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:48,762 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:48,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:15:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 14:15:48,987 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 11 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-08-27 14:15:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:49,038 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2021-08-27 14:15:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:15:49,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2021-08-27 14:15:49,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:49,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 43 transitions. [2021-08-27 14:15:49,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-08-27 14:15:49,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-08-27 14:15:49,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2021-08-27 14:15:49,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:49,041 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-27 14:15:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2021-08-27 14:15:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-27 14:15:49,043 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-08-27 14:15:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-08-27 14:15:49,043 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-27 14:15:49,044 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-27 14:15:49,044 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:15:49,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-08-27 14:15:49,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:49,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:49,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:49,045 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-08-27 14:15:49,045 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:49,045 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 189#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 202#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 208#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;havoc main_#t~post10; 200#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 201#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 203#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 204#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 212#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 190#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 191#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 215#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 214#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 213#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 209#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 198#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 199#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 205#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 194#L598-4 [2021-08-27 14:15:49,046 INFO L793 eck$LassoCheckResult]: Loop: 194#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 195#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 210#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 194#L598-4 [2021-08-27 14:15:49,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1239319610, now seen corresponding path program 1 times [2021-08-27 14:15:49,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:49,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146385221] [2021-08-27 14:15:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:49,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:49,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:49,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146385221] [2021-08-27 14:15:49,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146385221] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:49,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:49,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 14:15:49,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108702590] [2021-08-27 14:15:49,195 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2021-08-27 14:15:49,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:49,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074552245] [2021-08-27 14:15:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:49,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:49,210 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:49,224 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:49,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:49,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 14:15:49,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-08-27 14:15:49,453 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 10 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-08-27 14:15:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:49,698 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2021-08-27 14:15:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:15:49,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 61 transitions. [2021-08-27 14:15:49,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:49,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 61 transitions. [2021-08-27 14:15:49,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-08-27 14:15:49,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-08-27 14:15:49,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 61 transitions. [2021-08-27 14:15:49,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:49,702 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-08-27 14:15:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 61 transitions. [2021-08-27 14:15:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2021-08-27 14:15:49,704 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-08-27 14:15:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2021-08-27 14:15:49,705 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-08-27 14:15:49,705 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-08-27 14:15:49,705 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:15:49,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2021-08-27 14:15:49,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:49,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:49,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:49,707 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-08-27 14:15:49,707 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:49,707 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 286#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 299#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 295#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 296#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;havoc main_#t~post10; 315#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 313#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 300#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 301#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 310#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 287#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 288#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 303#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 312#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 311#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 305#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 293#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 294#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 302#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 291#L598-4 [2021-08-27 14:15:49,708 INFO L793 eck$LassoCheckResult]: Loop: 291#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 292#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 306#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 291#L598-4 [2021-08-27 14:15:49,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash -652513596, now seen corresponding path program 1 times [2021-08-27 14:15:49,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:49,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205217972] [2021-08-27 14:15:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:49,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:49,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:49,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205217972] [2021-08-27 14:15:49,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205217972] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:49,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:49,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 14:15:49,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76361387] [2021-08-27 14:15:49,815 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:49,816 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2021-08-27 14:15:49,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:49,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40979866] [2021-08-27 14:15:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:49,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:49,832 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:49,856 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:50,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:50,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 14:15:50,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 14:15:50,054 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 9 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-08-27 14:15:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:50,242 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2021-08-27 14:15:50,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:15:50,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2021-08-27 14:15:50,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:50,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 57 transitions. [2021-08-27 14:15:50,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-08-27 14:15:50,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-08-27 14:15:50,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 57 transitions. [2021-08-27 14:15:50,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:50,245 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2021-08-27 14:15:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 57 transitions. [2021-08-27 14:15:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-08-27 14:15:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 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-08-27 14:15:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-08-27 14:15:50,249 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-08-27 14:15:50,249 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-08-27 14:15:50,249 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:15:50,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2021-08-27 14:15:50,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:50,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:50,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:50,251 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-08-27 14:15:50,251 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:50,251 INFO L791 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 379#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 392#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 397#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 409#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;havoc main_#t~post10; 390#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 391#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 393#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 394#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 401#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 402#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 406#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 405#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 404#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 403#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 398#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 388#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 389#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 395#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 384#L598-4 [2021-08-27 14:15:50,251 INFO L793 eck$LassoCheckResult]: Loop: 384#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 385#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 399#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 384#L598-4 [2021-08-27 14:15:50,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:50,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1353578174, now seen corresponding path program 1 times [2021-08-27 14:15:50,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:50,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765275090] [2021-08-27 14:15:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:50,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:50,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:50,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765275090] [2021-08-27 14:15:50,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765275090] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:50,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:50,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 14:15:50,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375839855] [2021-08-27 14:15:50,326 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:50,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:50,326 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2021-08-27 14:15:50,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:50,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168533257] [2021-08-27 14:15:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:50,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:50,339 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:50,350 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:50,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:15:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:15:50,544 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 8 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-08-27 14:15:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:50,679 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2021-08-27 14:15:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:15:50,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2021-08-27 14:15:50,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:50,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2021-08-27 14:15:50,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-08-27 14:15:50,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-08-27 14:15:50,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2021-08-27 14:15:50,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:50,681 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2021-08-27 14:15:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2021-08-27 14:15:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2021-08-27 14:15:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 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-08-27 14:15:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-08-27 14:15:50,684 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-08-27 14:15:50,685 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-08-27 14:15:50,685 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:15:50,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2021-08-27 14:15:50,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:50,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:50,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:50,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-08-27 14:15:50,686 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:50,686 INFO L791 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 468#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 481#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 486#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 500#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;havoc main_#t~post10; 499#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 490#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 482#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 483#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 493#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 473#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 474#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 485#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 495#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 494#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 487#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 475#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 476#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 484#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 471#L598-4 [2021-08-27 14:15:50,687 INFO L793 eck$LassoCheckResult]: Loop: 471#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 472#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 488#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 471#L598-4 [2021-08-27 14:15:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2033636544, now seen corresponding path program 1 times [2021-08-27 14:15:50,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:50,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094257827] [2021-08-27 14:15:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:50,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:50,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:50,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094257827] [2021-08-27 14:15:50,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094257827] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:50,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:50,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 14:15:50,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693921032] [2021-08-27 14:15:50,753 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:50,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2021-08-27 14:15:50,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:50,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243684492] [2021-08-27 14:15:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:50,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:50,763 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:50,773 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:50,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:50,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:15:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:15:50,975 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 7 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-08-27 14:15:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:51,106 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-08-27 14:15:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:15:51,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 49 transitions. [2021-08-27 14:15:51,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:51,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 49 transitions. [2021-08-27 14:15:51,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-27 14:15:51,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-27 14:15:51,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2021-08-27 14:15:51,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:51,108 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2021-08-27 14:15:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2021-08-27 14:15:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2021-08-27 14:15:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 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-08-27 14:15:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-08-27 14:15:51,111 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-08-27 14:15:51,111 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-08-27 14:15:51,111 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:15:51,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2021-08-27 14:15:51,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:51,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:51,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:51,112 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-08-27 14:15:51,112 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:51,112 INFO L791 eck$LassoCheckResult]: Stem: 552#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 553#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 566#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 571#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 574#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;havoc main_#t~post10; 564#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 565#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 582#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 585#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 584#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 581#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 580#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 579#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 578#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 577#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 572#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 562#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 563#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 569#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 558#L598-4 [2021-08-27 14:15:51,113 INFO L793 eck$LassoCheckResult]: Loop: 558#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 559#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 573#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 558#L598-4 [2021-08-27 14:15:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:51,113 INFO L82 PathProgramCache]: Analyzing trace with hash 486323390, now seen corresponding path program 1 times [2021-08-27 14:15:51,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:51,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571611147] [2021-08-27 14:15:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:51,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:51,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:51,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571611147] [2021-08-27 14:15:51,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571611147] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:51,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:51,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 14:15:51,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450529695] [2021-08-27 14:15:51,274 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:51,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:51,274 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2021-08-27 14:15:51,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:51,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794873651] [2021-08-27 14:15:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:51,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:51,283 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:51,293 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:51,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:51,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 14:15:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-08-27 14:15:51,514 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 6 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-08-27 14:15:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:51,719 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2021-08-27 14:15:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 14:15:51,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 69 transitions. [2021-08-27 14:15:51,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:51,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 69 transitions. [2021-08-27 14:15:51,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-27 14:15:51,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-27 14:15:51,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 69 transitions. [2021-08-27 14:15:51,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:51,728 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-08-27 14:15:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 69 transitions. [2021-08-27 14:15:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2021-08-27 14:15:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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-08-27 14:15:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-08-27 14:15:51,739 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-27 14:15:51,739 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-27 14:15:51,739 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:15:51,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2021-08-27 14:15:51,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:51,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:51,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:51,741 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-08-27 14:15:51,742 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:51,742 INFO L791 eck$LassoCheckResult]: Stem: 661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 662#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 675#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 669#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 670#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;havoc main_#t~post10; 691#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 690#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 676#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 677#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 689#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 665#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 666#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 679#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 667#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 668#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 683#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 688#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 672#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 678#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 663#L598-4 [2021-08-27 14:15:51,743 INFO L793 eck$LassoCheckResult]: Loop: 663#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 664#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 681#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 663#L598-4 [2021-08-27 14:15:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash 488170432, now seen corresponding path program 1 times [2021-08-27 14:15:51,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:51,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955466840] [2021-08-27 14:15:51,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:51,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:51,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:51,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955466840] [2021-08-27 14:15:51,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955466840] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:51,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:51,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 14:15:51,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554238865] [2021-08-27 14:15:51,817 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2021-08-27 14:15:51,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:51,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245912816] [2021-08-27 14:15:51,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:51,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:51,826 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:51,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:52,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:52,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:15:52,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:15:52,013 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.8) 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-08-27 14:15:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:52,082 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-08-27 14:15:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:15:52,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2021-08-27 14:15:52,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:52,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2021-08-27 14:15:52,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-27 14:15:52,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-27 14:15:52,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2021-08-27 14:15:52,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:52,084 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2021-08-27 14:15:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2021-08-27 14:15:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2021-08-27 14:15:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 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-08-27 14:15:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-08-27 14:15:52,086 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-08-27 14:15:52,087 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-08-27 14:15:52,087 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:15:52,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2021-08-27 14:15:52,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:52,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:52,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:52,088 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-08-27 14:15:52,088 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:52,088 INFO L791 eck$LassoCheckResult]: Stem: 746#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 747#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 760#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 765#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 768#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;havoc main_#t~post10; 758#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 759#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 761#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 762#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 771#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 748#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 749#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 764#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 750#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 751#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 766#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 756#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 757#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 763#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 752#L598-4 [2021-08-27 14:15:52,088 INFO L793 eck$LassoCheckResult]: Loop: 752#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 753#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 767#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 752#L598-4 [2021-08-27 14:15:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2021-08-27 14:15:52,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:52,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55963186] [2021-08-27 14:15:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:52,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:52,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:52,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55963186] [2021-08-27 14:15:52,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55963186] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:52,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:52,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:15:52,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888705484] [2021-08-27 14:15:52,131 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:52,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:52,131 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2021-08-27 14:15:52,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:52,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562396187] [2021-08-27 14:15:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:52,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:52,139 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:52,146 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:52,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:15:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:15:52,341 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. cyclomatic complexity: 5 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-08-27 14:15:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:52,404 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2021-08-27 14:15:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:15:52,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2021-08-27 14:15:52,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:52,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 46 transitions. [2021-08-27 14:15:52,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-27 14:15:52,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-27 14:15:52,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2021-08-27 14:15:52,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:52,407 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2021-08-27 14:15:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2021-08-27 14:15:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-08-27 14:15:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 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-08-27 14:15:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-08-27 14:15:52,409 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-08-27 14:15:52,409 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-08-27 14:15:52,409 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:15:52,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2021-08-27 14:15:52,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:52,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:52,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:52,410 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-08-27 14:15:52,410 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:52,410 INFO L791 eck$LassoCheckResult]: Stem: 831#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 832#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 845#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 850#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 853#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;havoc main_#t~post10; 843#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 844#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 846#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 847#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 856#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 833#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 834#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 849#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 835#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 836#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 851#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 841#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 842#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 848#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 837#L598-4 [2021-08-27 14:15:52,411 INFO L793 eck$LassoCheckResult]: Loop: 837#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 838#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 852#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 837#L598-4 [2021-08-27 14:15:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2021-08-27 14:15:52,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:52,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101561543] [2021-08-27 14:15:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:52,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:52,423 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:52,439 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2021-08-27 14:15:52,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:52,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351866875] [2021-08-27 14:15:52,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:52,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:52,447 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:52,454 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2021-08-27 14:15:52,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:52,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461039457] [2021-08-27 14:15:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:52,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:52,470 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:52,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:56,376 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:15:56,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:15:56,377 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:15:56,377 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:15:56,377 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:15:56,377 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:56,377 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:15:56,377 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:15:56,377 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration10_Lasso [2021-08-27 14:15:56,377 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:15:56,377 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:15:56,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:56,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:15:57,554 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:15:57,557 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:15:57,558 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,572 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-08-27 14:15:57,572 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-08-27 14:15:57,575 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-08-27 14:15:57,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:15:57,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:15:57,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:15:57,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:15:57,621 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-08-27 14:15:57,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,623 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-08-27 14:15:57,632 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-08-27 14:15:57,633 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-08-27 14:15:57,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:15:57,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:15:57,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:15:57,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:15:57,690 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-08-27 14:15:57,690 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,693 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-08-27 14:15:57,698 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-08-27 14:15:57,698 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-08-27 14:15:57,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:15:57,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:15:57,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:15:57,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:15:57,729 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-08-27 14:15:57,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,731 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-08-27 14:15:57,731 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-08-27 14:15:57,737 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-08-27 14:15:57,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:15:57,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:15:57,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:15:57,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:15:57,769 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-08-27 14:15:57,769 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,770 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-08-27 14:15:57,771 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-08-27 14:15:57,774 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-08-27 14:15:57,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:15:57,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:15:57,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:15:57,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:15:57,799 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-08-27 14:15:57,799 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,800 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-08-27 14:15:57,801 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-08-27 14:15:57,802 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-08-27 14:15:57,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:15:57,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:15:57,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:15:57,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:15:57,825 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-08-27 14:15:57,826 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,826 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-08-27 14:15:57,827 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-08-27 14:15:57,828 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-08-27 14:15:57,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:15:57,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:15:57,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:15:57,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:15:57,894 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-08-27 14:15:57,894 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,895 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-08-27 14:15:57,896 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-08-27 14:15:57,897 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-08-27 14:15:57,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:15:57,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:15:57,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:15:57,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-08-27 14:15:57,938 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,939 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-08-27 14:15:57,939 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-08-27 14:15:57,940 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-08-27 14:15:57,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:15:57,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:15:57,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:15:57,972 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-08-27 14:15:57,972 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:57,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:57,973 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-08-27 14:15:57,974 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-08-27 14:15:57,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:15:57,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:15:57,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:15:57,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:15:57,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:15:57,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:15:57,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:15:58,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:15:58,016 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-08-27 14:15:58,016 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-08-27 14:15:58,018 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:15:58,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:15:58,025 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-08-27 14:15:58,045 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:15:58,053 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-08-27 14:15:58,062 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-08-27 14:15:58,062 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:15:58,062 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 100 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 2 >= 0] [2021-08-27 14:15:58,085 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-08-27 14:15:58,199 INFO L297 tatePredicateManager]: 37 out of 40 supporting invariants were superfluous and have been removed [2021-08-27 14:15:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:58,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 14:15:58,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:15:58,334 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 14:15:58,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-27 14:15:58,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:15:58,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:15:58,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 14:15:58,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:15:58,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:15:58,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:15:58,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:15:58,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:15:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:58,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 14:15:58,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:15:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:59,095 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-08-27 14:15:59,095 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 42 transitions. cyclomatic complexity: 5 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-08-27 14:15:59,396 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 42 transitions. cyclomatic complexity: 5. 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 53 states and 61 transitions. Complement of second has 17 states. [2021-08-27 14:15:59,396 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-08-27 14:15:59,397 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-08-27 14:15:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2021-08-27 14:15:59,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 3 letters. [2021-08-27 14:15:59,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:15:59,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 22 letters. Loop has 3 letters. [2021-08-27 14:15:59,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:15:59,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 6 letters. [2021-08-27 14:15:59,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:15:59,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 61 transitions. [2021-08-27 14:15:59,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 14:15:59,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 29 states and 34 transitions. [2021-08-27 14:15:59,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-27 14:15:59,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-27 14:15:59,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2021-08-27 14:15:59,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:59,401 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-08-27 14:15:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2021-08-27 14:15:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2021-08-27 14:15:59,402 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-08-27 14:15:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-08-27 14:15:59,403 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-08-27 14:15:59,403 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-08-27 14:15:59,403 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 14:15:59,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2021-08-27 14:15:59,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:59,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:59,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:59,404 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-08-27 14:15:59,404 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:59,404 INFO L791 eck$LassoCheckResult]: Stem: 1210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1211#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1225#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1221#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1222#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 1223#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1224#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 1226#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1227#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 1233#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1216#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 1217#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1229#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 1212#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1213#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 1231#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1218#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1219#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1230#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1214#L598-4 [2021-08-27 14:15:59,405 INFO L793 eck$LassoCheckResult]: Loop: 1214#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1215#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1232#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1214#L598-4 [2021-08-27 14:15:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash 189281224, now seen corresponding path program 1 times [2021-08-27 14:15:59,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:59,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128905486] [2021-08-27 14:15:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:59,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:15:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:15:59,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:15:59,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128905486] [2021-08-27 14:15:59,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128905486] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:15:59,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:15:59,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 14:15:59,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211109197] [2021-08-27 14:15:59,581 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:15:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:59,581 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2021-08-27 14:15:59,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:59,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187008545] [2021-08-27 14:15:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:59,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:59,589 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:59,596 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:59,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:15:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 14:15:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 14:15:59,796 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 1.2666666666666666) 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-08-27 14:15:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:15:59,931 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-08-27 14:15:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 14:15:59,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2021-08-27 14:15:59,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:59,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2021-08-27 14:15:59,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-27 14:15:59,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-08-27 14:15:59,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2021-08-27 14:15:59,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:15:59,933 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-08-27 14:15:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2021-08-27 14:15:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2021-08-27 14:15:59,934 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-08-27 14:15:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-08-27 14:15:59,935 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 14:15:59,935 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 14:15:59,935 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 14:15:59,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2021-08-27 14:15:59,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:15:59,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:15:59,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:15:59,936 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-08-27 14:15:59,936 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:15:59,936 INFO L791 eck$LassoCheckResult]: Stem: 1282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1283#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1296#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1290#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1291#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 1294#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1295#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 1297#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1298#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 1303#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1284#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 1285#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1300#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 1286#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1287#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 1302#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1292#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 1293#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1299#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 1288#L598-4 [2021-08-27 14:15:59,936 INFO L793 eck$LassoCheckResult]: Loop: 1288#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1289#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1301#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1288#L598-4 [2021-08-27 14:15:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:59,937 INFO L82 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2021-08-27 14:15:59,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:59,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125527435] [2021-08-27 14:15:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:59,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:59,948 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:59,960 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2021-08-27 14:15:59,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:59,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141428418] [2021-08-27 14:15:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:59,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:59,967 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:15:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:59,973 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:15:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:15:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2021-08-27 14:15:59,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:15:59,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034229660] [2021-08-27 14:15:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:15:59,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:15:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:15:59,998 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:00,026 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:04,426 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:16:04,426 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:16:04,426 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:16:04,426 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:16:04,426 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:16:04,426 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:04,426 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:16:04,426 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:16:04,427 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration12_Lasso [2021-08-27 14:16:04,427 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:16:04,427 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:16:04,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:04,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:05,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:16:05,650 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:16:05,650 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,653 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-08-27 14:16:05,654 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-08-27 14:16:05,656 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-08-27 14:16:05,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,682 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-08-27 14:16:05,682 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,683 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-08-27 14:16:05,685 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-08-27 14:16:05,686 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-08-27 14:16:05,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,713 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-08-27 14:16:05,714 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,720 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-08-27 14:16:05,721 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-08-27 14:16:05,722 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-08-27 14:16:05,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,748 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-08-27 14:16:05,748 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,749 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-08-27 14:16:05,751 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-08-27 14:16:05,751 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-08-27 14:16:05,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,779 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-08-27 14:16:05,779 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,780 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-08-27 14:16:05,781 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-08-27 14:16:05,782 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-08-27 14:16:05,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:05,807 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,808 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:16:05,809 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-08-27 14:16:05,813 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-08-27 14:16:05,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,841 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-08-27 14:16:05,841 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,842 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-08-27 14:16:05,843 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-08-27 14:16:05,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-08-27 14:16:05,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,868 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-08-27 14:16:05,868 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,869 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-08-27 14:16:05,872 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-08-27 14:16:05,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:16:05,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:05,897 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,898 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-08-27 14:16:05,899 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-08-27 14:16:05,900 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-08-27 14:16:05,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:05,928 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,928 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-08-27 14:16:05,930 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-08-27 14:16:05,930 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-08-27 14:16:05,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:05,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:05,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:05,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-08-27 14:16:05,955 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,956 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-08-27 14:16:05,956 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-08-27 14:16:05,958 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-08-27 14:16:05,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:05,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:16:05,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:16:05,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:05,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-08-27 14:16:05,987 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:05,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,988 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-08-27 14:16:05,988 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-08-27 14:16:05,990 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-08-27 14:16:05,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:05,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:05,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:05,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:06,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:16:06,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:16:06,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:16:06,023 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-08-27 14:16:06,023 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-08-27 14:16:06,024 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:06,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:06,024 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-08-27 14:16:06,025 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-08-27 14:16:06,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:16:06,035 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-08-27 14:16:06,035 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:16:06,035 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 + 100 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 2 >= 0] [2021-08-27 14:16:06,051 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-08-27 14:16:06,093 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-08-27 14:16:06,184 INFO L297 tatePredicateManager]: 37 out of 40 supporting invariants were superfluous and have been removed [2021-08-27 14:16:06,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:06,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 14:16:06,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:06,265 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 14:16:06,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-27 14:16:06,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:06,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:16:06,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:16:06,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:16:06,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:16:06,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:16:06,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:16:06,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:16:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:06,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 14:16:06,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:06,945 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-08-27 14:16:06,945 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-08-27 14:16:07,126 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-08-27 14:16:07,126 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-08-27 14:16:07,126 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-08-27 14:16:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2021-08-27 14:16:07,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 3 letters. [2021-08-27 14:16:07,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:16:07,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 22 letters. Loop has 3 letters. [2021-08-27 14:16:07,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:16:07,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 6 letters. [2021-08-27 14:16:07,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:16:07,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2021-08-27 14:16:07,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:16:07,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 23 transitions. [2021-08-27 14:16:07,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-08-27 14:16:07,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-08-27 14:16:07,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2021-08-27 14:16:07,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:07,128 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-08-27 14:16:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2021-08-27 14:16:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-27 14:16:07,129 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-08-27 14:16:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-08-27 14:16:07,131 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-08-27 14:16:07,131 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-08-27 14:16:07,131 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 14:16:07,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2021-08-27 14:16:07,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 14:16:07,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:07,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:07,132 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-08-27 14:16:07,132 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:16:07,132 INFO L791 eck$LassoCheckResult]: Stem: 1613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1614#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1629#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1623#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1624#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 1625#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1626#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 1627#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1628#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 1634#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1615#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 1616#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1631#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 1617#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1618#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 1633#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1621#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 1622#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1630#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1619#L598-4 [2021-08-27 14:16:07,132 INFO L793 eck$LassoCheckResult]: Loop: 1619#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1620#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1632#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem51;havoc main_#t~mem52;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1619#L598-4 [2021-08-27 14:16:07,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2021-08-27 14:16:07,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:07,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297153932] [2021-08-27 14:16:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:07,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:07,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:07,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297153932] [2021-08-27 14:16:07,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297153932] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:16:07,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:16:07,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 14:16:07,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686824950] [2021-08-27 14:16:07,368 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:16:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2021-08-27 14:16:07,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:07,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249730975] [2021-08-27 14:16:07,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:07,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:07,377 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:07,383 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:07,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 14:16:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-08-27 14:16:07,570 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 17 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-08-27 14:16:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:07,653 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2021-08-27 14:16:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 14:16:07,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2021-08-27 14:16:07,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:16:07,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2021-08-27 14:16:07,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 14:16:07,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 14:16:07,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 14:16:07,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:07,654 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:16:07,654 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:16:07,654 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:16:07,654 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 14:16:07,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 14:16:07,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:16:07,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 14:16:07,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:16:07 BoogieIcfgContainer [2021-08-27 14:16:07,658 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:16:07,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:16:07,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:16:07,658 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:16:07,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:15:47" (3/4) ... [2021-08-27 14:16:07,661 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 14:16:07,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:16:07,662 INFO L168 Benchmark]: Toolchain (without parser) took 21431.06 ms. Allocated memory was 58.7 MB in the beginning and 222.3 MB in the end (delta: 163.6 MB). Free memory was 36.8 MB in the beginning and 131.7 MB in the end (delta: -94.9 MB). Peak memory consumption was 69.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:07,662 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 58.7 MB. Free memory was 41.0 MB in the beginning and 41.0 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:16:07,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.91 ms. Allocated memory is still 58.7 MB. Free memory was 36.7 MB in the beginning and 37.9 MB in the end (delta: -1.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:07,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 58.7 MB. Free memory was 37.9 MB in the beginning and 35.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:07,663 INFO L168 Benchmark]: Boogie Preprocessor took 21.51 ms. Allocated memory is still 58.7 MB. Free memory was 35.7 MB in the beginning and 34.3 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:16:07,663 INFO L168 Benchmark]: RCFGBuilder took 511.76 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.1 MB in the beginning and 37.5 MB in the end (delta: -3.4 MB). Peak memory consumption was 11.8 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:07,663 INFO L168 Benchmark]: BuchiAutomizer took 20483.92 ms. Allocated memory was 71.3 MB in the beginning and 222.3 MB in the end (delta: 151.0 MB). Free memory was 37.2 MB in the beginning and 131.7 MB in the end (delta: -94.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:07,664 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 222.3 MB. Free memory is still 131.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:16:07,665 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.19 ms. Allocated memory is still 58.7 MB. Free memory was 41.0 MB in the beginning and 41.0 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 365.91 ms. Allocated memory is still 58.7 MB. Free memory was 36.7 MB in the beginning and 37.9 MB in the end (delta: -1.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 58.7 MB. Free memory was 37.9 MB in the beginning and 35.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.51 ms. Allocated memory is still 58.7 MB. Free memory was 35.7 MB in the beginning and 34.3 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 511.76 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.1 MB in the beginning and 37.5 MB in the end (delta: -3.4 MB). Peak memory consumption was 11.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 20483.92 ms. Allocated memory was 71.3 MB in the beginning and 222.3 MB in the end (delta: 151.0 MB). Free memory was 37.2 MB in the beginning and 131.7 MB in the end (delta: -94.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.89 ms. Allocated memory is still 222.3 MB. Free memory is still 131.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 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. 11 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.4s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 16.4s. Construction of modules took 1.3s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 50.5ms AutomataMinimizationTime, 12 MinimizatonAttempts, 94 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 9. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 232 SDtfs, 237 SDslu, 308 SDs, 0 SdLazy, 2257 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1333.7ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital352 mio100 ax105 hnf100 lsp90 ukn56 mio100 lsp37 div100 bol100 ite100 ukn100 eq188 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 2 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-08-27 14:16:07,701 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...