./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 5fbdf5bf 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 01:34:22,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 01:34:22,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 01:34:22,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 01:34:22,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 01:34:22,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 01:34:22,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 01:34:22,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 01:34:22,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 01:34:22,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 01:34:22,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 01:34:22,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 01:34:22,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 01:34:22,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 01:34:22,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 01:34:22,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 01:34:22,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 01:34:22,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 01:34:22,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 01:34:22,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 01:34:22,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 01:34:22,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 01:34:22,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 01:34:22,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 01:34:22,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 01:34:22,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 01:34:22,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 01:34:22,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 01:34:22,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 01:34:22,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 01:34:22,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 01:34:22,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 01:34:22,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 01:34:22,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 01:34:22,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 01:34:22,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 01:34:22,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 01:34:22,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 01:34:22,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 01:34:22,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 01:34:22,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 01:34:22,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-31 01:34:22,159 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 01:34:22,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 01:34:22,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 01:34:22,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 01:34:22,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 01:34:22,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 01:34:22,161 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 01:34:22,162 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 01:34:22,162 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 01:34:22,162 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 01:34:22,163 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 01:34:22,163 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 01:34:22,163 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 01:34:22,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 01:34:22,163 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 01:34:22,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 01:34:22,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 01:34:22,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 01:34:22,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 01:34:22,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 01:34:22,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 01:34:22,164 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 01:34:22,164 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 01:34:22,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 01:34:22,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 01:34:22,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 01:34:22,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 01:34:22,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 01:34:22,165 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 01:34:22,166 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 01:34:22,166 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-31 01:34:22,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 01:34:22,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 01:34:22,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 01:34:22,418 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 01:34:22,418 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 01:34:22,419 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-31 01:34:22,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8afbb24/24cceb8f796b46209bfe79da13f926ed/FLAG398dd61af [2021-08-31 01:34:22,842 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 01:34:22,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2021-08-31 01:34:22,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8afbb24/24cceb8f796b46209bfe79da13f926ed/FLAG398dd61af [2021-08-31 01:34:23,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8afbb24/24cceb8f796b46209bfe79da13f926ed [2021-08-31 01:34:23,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 01:34:23,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 01:34:23,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 01:34:23,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 01:34:23,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 01:34:23,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72161e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23, skipping insertion in model container [2021-08-31 01:34:23,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 01:34:23,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 01:34:23,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 01:34:23,449 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 01:34:23,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 01:34:23,502 INFO L208 MainTranslator]: Completed translation [2021-08-31 01:34:23,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23 WrapperNode [2021-08-31 01:34:23,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 01:34:23,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 01:34:23,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 01:34:23,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 01:34:23,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 01:34:23,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 01:34:23,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 01:34:23,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 01:34:23,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 01:34:23,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 01:34:23,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 01:34:23,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 01:34:23,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (1/1) ... [2021-08-31 01:34:23,553 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:23,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:23,570 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-31 01:34:23,571 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-31 01:34:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-31 01:34:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-31 01:34:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 01:34:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-31 01:34:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 01:34:23,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 01:34:23,844 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 01:34:23,845 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-31 01:34:23,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:34:23 BoogieIcfgContainer [2021-08-31 01:34:23,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 01:34:23,847 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 01:34:23,848 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 01:34:23,850 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 01:34:23,850 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:34:23,851 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 01:34:23" (1/3) ... [2021-08-31 01:34:23,851 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bd3af1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 01:34:23, skipping insertion in model container [2021-08-31 01:34:23,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:34:23,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:34:23" (2/3) ... [2021-08-31 01:34:23,852 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bd3af1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 01:34:23, skipping insertion in model container [2021-08-31 01:34:23,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:34:23,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:34:23" (3/3) ... [2021-08-31 01:34:23,853 INFO L389 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2021-08-31 01:34:23,899 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 01:34:23,899 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 01:34:23,899 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 01:34:23,899 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 01:34:23,900 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 01:34:23,900 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 01:34:23,900 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 01:34:23,900 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 01:34:23,910 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-31 01:34:23,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:23,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:23,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:23,929 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-31 01:34:23,930 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:23,930 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 01:34:23,930 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-31 01:34:23,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:23,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:23,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:23,935 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-31 01:34:23,935 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:23,941 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-31 01:34:23,941 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-31 01:34:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2021-08-31 01:34:23,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:23,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181031023] [2021-08-31 01:34:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:23,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:24,294 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-31 01:34:24,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:24,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181031023] [2021-08-31 01:34:24,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181031023] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:24,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:24,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-31 01:34:24,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158969873] [2021-08-31 01:34:24,300 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2021-08-31 01:34:24,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:24,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370939487] [2021-08-31 01:34:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:24,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:24,319 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:24,341 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:24,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:24,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-31 01:34:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-31 01:34:24,549 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-31 01:34:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:24,839 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2021-08-31 01:34:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-31 01:34:24,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 81 transitions. [2021-08-31 01:34:24,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:24,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 49 states and 65 transitions. [2021-08-31 01:34:24,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2021-08-31 01:34:24,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2021-08-31 01:34:24,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2021-08-31 01:34:24,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:24,857 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2021-08-31 01:34:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2021-08-31 01:34:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2021-08-31 01:34:24,873 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-31 01:34:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-08-31 01:34:24,877 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-08-31 01:34:24,877 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-08-31 01:34:24,877 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 01:34:24,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2021-08-31 01:34:24,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:24,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:24,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:24,881 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-31 01:34:24,881 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:24,882 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-31 01:34:24,883 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-31 01:34:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1775784008, now seen corresponding path program 1 times [2021-08-31 01:34:24,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:24,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574043463] [2021-08-31 01:34:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:24,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:24,932 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-31 01:34:24,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:24,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574043463] [2021-08-31 01:34:24,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574043463] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:24,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:24,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:34:24,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366559453] [2021-08-31 01:34:24,933 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2021-08-31 01:34:24,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:24,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917413269] [2021-08-31 01:34:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:24,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:24,949 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:24,960 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:25,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:25,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 01:34:25,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 01:34:25,106 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-31 01:34:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:25,165 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2021-08-31 01:34:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 01:34:25,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2021-08-31 01:34:25,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:25,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 43 transitions. [2021-08-31 01:34:25,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-08-31 01:34:25,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-08-31 01:34:25,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2021-08-31 01:34:25,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:25,167 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-31 01:34:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2021-08-31 01:34:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-31 01:34:25,169 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-31 01:34:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-08-31 01:34:25,169 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-31 01:34:25,169 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-31 01:34:25,169 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 01:34:25,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-08-31 01:34:25,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:25,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:25,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:25,170 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-31 01:34:25,170 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:25,170 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-31 01:34:25,170 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-31 01:34:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1239319610, now seen corresponding path program 1 times [2021-08-31 01:34:25,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:25,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311174861] [2021-08-31 01:34:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:25,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:25,268 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-31 01:34:25,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:25,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311174861] [2021-08-31 01:34:25,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311174861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:25,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:25,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-31 01:34:25,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881269790] [2021-08-31 01:34:25,270 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2021-08-31 01:34:25,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:25,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132199121] [2021-08-31 01:34:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:25,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:25,279 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:25,313 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:25,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-31 01:34:25,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-08-31 01:34:25,471 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-31 01:34:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:25,645 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2021-08-31 01:34:25,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:34:25,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 61 transitions. [2021-08-31 01:34:25,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:25,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 61 transitions. [2021-08-31 01:34:25,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-08-31 01:34:25,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-08-31 01:34:25,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 61 transitions. [2021-08-31 01:34:25,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:25,648 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-08-31 01:34:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 61 transitions. [2021-08-31 01:34:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2021-08-31 01:34:25,649 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-31 01:34:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2021-08-31 01:34:25,650 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-08-31 01:34:25,650 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-08-31 01:34:25,650 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 01:34:25,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2021-08-31 01:34:25,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:25,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:25,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:25,651 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:34:25,651 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:25,651 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-31 01:34:25,652 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-31 01:34:25,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash -652513596, now seen corresponding path program 1 times [2021-08-31 01:34:25,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:25,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791634064] [2021-08-31 01:34:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:25,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:34:25,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:25,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791634064] [2021-08-31 01:34:25,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791634064] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:25,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:25,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-31 01:34:25,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235287741] [2021-08-31 01:34:25,749 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:25,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2021-08-31 01:34:25,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:25,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234530165] [2021-08-31 01:34:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:25,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:25,778 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:25,787 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:25,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:25,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-31 01:34:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-31 01:34:25,930 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-31 01:34:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:26,068 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2021-08-31 01:34:26,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:34:26,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2021-08-31 01:34:26,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:26,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 57 transitions. [2021-08-31 01:34:26,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-08-31 01:34:26,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-08-31 01:34:26,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 57 transitions. [2021-08-31 01:34:26,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:26,070 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2021-08-31 01:34:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 57 transitions. [2021-08-31 01:34:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-08-31 01:34:26,072 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-31 01:34:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-08-31 01:34:26,072 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-08-31 01:34:26,072 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-08-31 01:34:26,073 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 01:34:26,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2021-08-31 01:34:26,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:26,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:26,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:26,073 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-31 01:34:26,074 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:26,074 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-31 01:34:26,074 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-31 01:34:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1353578174, now seen corresponding path program 1 times [2021-08-31 01:34:26,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:26,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136480233] [2021-08-31 01:34:26,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:26,075 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:26,116 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-31 01:34:26,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:26,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136480233] [2021-08-31 01:34:26,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136480233] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:26,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:26,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-31 01:34:26,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317623558] [2021-08-31 01:34:26,118 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2021-08-31 01:34:26,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:26,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578039251] [2021-08-31 01:34:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:26,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:26,131 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:26,153 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:26,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 01:34:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-31 01:34:26,295 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-31 01:34:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:26,407 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2021-08-31 01:34:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:34:26,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2021-08-31 01:34:26,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:26,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2021-08-31 01:34:26,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-08-31 01:34:26,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-08-31 01:34:26,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2021-08-31 01:34:26,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:26,409 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2021-08-31 01:34:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2021-08-31 01:34:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2021-08-31 01:34:26,410 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-31 01:34:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-08-31 01:34:26,411 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-08-31 01:34:26,411 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-08-31 01:34:26,411 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 01:34:26,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2021-08-31 01:34:26,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:26,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:26,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:26,412 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-31 01:34:26,412 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:26,412 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-31 01:34:26,412 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-31 01:34:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:26,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2033636544, now seen corresponding path program 1 times [2021-08-31 01:34:26,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:26,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132695252] [2021-08-31 01:34:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:26,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:26,458 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-31 01:34:26,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:26,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132695252] [2021-08-31 01:34:26,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132695252] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:26,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:26,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-31 01:34:26,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105589821] [2021-08-31 01:34:26,460 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:26,460 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2021-08-31 01:34:26,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:26,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968681738] [2021-08-31 01:34:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:26,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:26,477 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:26,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:26,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 01:34:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-31 01:34:26,623 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-31 01:34:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:26,716 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-08-31 01:34:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:34:26,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 49 transitions. [2021-08-31 01:34:26,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:26,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 49 transitions. [2021-08-31 01:34:26,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-31 01:34:26,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-31 01:34:26,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2021-08-31 01:34:26,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:26,718 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2021-08-31 01:34:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2021-08-31 01:34:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2021-08-31 01:34:26,719 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-31 01:34:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-08-31 01:34:26,720 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-08-31 01:34:26,720 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-08-31 01:34:26,720 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 01:34:26,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2021-08-31 01:34:26,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:26,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:26,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:26,721 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-31 01:34:26,721 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:26,721 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-31 01:34:26,721 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-31 01:34:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash 486323390, now seen corresponding path program 1 times [2021-08-31 01:34:26,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:26,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328562729] [2021-08-31 01:34:26,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:26,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:26,842 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-31 01:34:26,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:26,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328562729] [2021-08-31 01:34:26,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328562729] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:26,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:26,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-31 01:34:26,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994730928] [2021-08-31 01:34:26,843 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:26,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2021-08-31 01:34:26,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:26,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114445159] [2021-08-31 01:34:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:26,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:26,849 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:26,855 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:26,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:26,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-31 01:34:26,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-08-31 01:34:26,998 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-31 01:34:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:27,130 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2021-08-31 01:34:27,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-31 01:34:27,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 69 transitions. [2021-08-31 01:34:27,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:27,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 69 transitions. [2021-08-31 01:34:27,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-31 01:34:27,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-31 01:34:27,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 69 transitions. [2021-08-31 01:34:27,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:27,132 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-08-31 01:34:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 69 transitions. [2021-08-31 01:34:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2021-08-31 01:34:27,133 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-31 01:34:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-08-31 01:34:27,133 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-31 01:34:27,133 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-31 01:34:27,133 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 01:34:27,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2021-08-31 01:34:27,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:27,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:27,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:27,134 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-31 01:34:27,134 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:27,135 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-31 01:34:27,135 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-31 01:34:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:27,135 INFO L82 PathProgramCache]: Analyzing trace with hash 488170432, now seen corresponding path program 1 times [2021-08-31 01:34:27,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:27,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176898782] [2021-08-31 01:34:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:27,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:27,166 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-31 01:34:27,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:27,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176898782] [2021-08-31 01:34:27,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176898782] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:27,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:27,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 01:34:27,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857419213] [2021-08-31 01:34:27,167 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2021-08-31 01:34:27,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:27,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997574490] [2021-08-31 01:34:27,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:27,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,174 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,180 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:27,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:27,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 01:34:27,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-31 01:34:27,318 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-31 01:34:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:27,382 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-08-31 01:34:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:34:27,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2021-08-31 01:34:27,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:27,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2021-08-31 01:34:27,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-31 01:34:27,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-31 01:34:27,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2021-08-31 01:34:27,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:27,384 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2021-08-31 01:34:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2021-08-31 01:34:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2021-08-31 01:34:27,385 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-31 01:34:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-08-31 01:34:27,385 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-08-31 01:34:27,386 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-08-31 01:34:27,386 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 01:34:27,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2021-08-31 01:34:27,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:27,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:27,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:27,386 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-31 01:34:27,387 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:27,387 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-31 01:34:27,387 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-31 01:34:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2021-08-31 01:34:27,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:27,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471651207] [2021-08-31 01:34:27,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:27,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:27,415 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-31 01:34:27,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:27,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471651207] [2021-08-31 01:34:27,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471651207] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:27,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:27,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:34:27,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550369749] [2021-08-31 01:34:27,416 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:27,417 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2021-08-31 01:34:27,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:27,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986970853] [2021-08-31 01:34:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:27,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,422 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,434 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:27,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:27,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 01:34:27,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-31 01:34:27,551 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-31 01:34:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:27,599 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2021-08-31 01:34:27,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:34:27,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2021-08-31 01:34:27,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:27,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 46 transitions. [2021-08-31 01:34:27,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-31 01:34:27,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-31 01:34:27,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2021-08-31 01:34:27,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:27,601 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2021-08-31 01:34:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2021-08-31 01:34:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-08-31 01:34:27,602 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-31 01:34:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-08-31 01:34:27,602 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-08-31 01:34:27,602 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-08-31 01:34:27,602 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 01:34:27,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2021-08-31 01:34:27,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:27,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:27,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:27,603 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-31 01:34:27,603 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:27,603 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-31 01:34:27,603 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-31 01:34:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2021-08-31 01:34:27,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:27,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348799396] [2021-08-31 01:34:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:27,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,623 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,640 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2021-08-31 01:34:27,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:27,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134900367] [2021-08-31 01:34:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:27,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,649 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,653 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:27,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2021-08-31 01:34:27,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:27,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860254747] [2021-08-31 01:34:27,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:27,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,665 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:27,679 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:30,872 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:34:30,872 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:34:30,872 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:34:30,872 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:34:30,872 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:34:30,872 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:30,873 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:34:30,873 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:34:30,873 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration10_Lasso [2021-08-31 01:34:30,873 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:34:30,873 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:34:30,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-31 01:34:30,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-31 01:34:30,903 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-31 01:34:30,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-31 01:34:30,905 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-31 01:34:30,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-31 01:34:30,908 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-31 01:34:30,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-31 01:34:31,228 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-31 01:34:31,229 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-31 01:34:31,230 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-31 01:34:31,231 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-31 01:34:31,233 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-31 01:34:31,234 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-31 01:34:31,235 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-31 01:34:31,236 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-31 01:34:31,237 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-31 01:34:31,239 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-31 01:34:31,240 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-31 01:34:31,242 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-31 01:34:31,251 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-31 01:34:31,253 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-31 01:34:31,255 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-31 01:34:31,256 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-31 01:34:31,264 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-31 01:34:31,265 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-31 01:34:31,267 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-31 01:34:31,268 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-31 01:34:31,269 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-31 01:34:31,270 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-31 01:34:31,271 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-31 01:34:31,272 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-31 01:34:31,273 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-31 01:34:31,274 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-31 01:34:31,276 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-31 01:34:31,277 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-31 01:34:31,278 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-31 01:34:31,279 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-31 01:34:31,281 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-31 01:34:31,283 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-31 01:34:31,284 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-31 01:34:31,286 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-31 01:34:31,287 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-31 01:34:31,288 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-31 01:34:31,289 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-31 01:34:31,291 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-31 01:34:31,292 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-31 01:34:31,294 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-31 01:34:31,295 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-31 01:34:31,296 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-31 01:34:31,297 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-31 01:34:31,298 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-31 01:34:31,300 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-31 01:34:31,301 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-31 01:34:31,303 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-31 01:34:31,304 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-31 01:34:31,305 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-31 01:34:31,671 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:34:31,673 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:34:31,674 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:31,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:31,675 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-31 01:34:31,676 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-31 01:34:31,679 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-31 01:34:31,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:31,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:31,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:31,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:31,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:31,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:31,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:31,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:31,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-31 01:34:31,706 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:31,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:31,707 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-31 01:34:31,707 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-31 01:34:31,708 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-31 01:34:31,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:31,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:31,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:31,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:31,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:31,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:31,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:31,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:31,743 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-31 01:34:31,743 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:31,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:31,744 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-31 01:34:31,747 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-31 01:34:31,748 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-31 01:34:31,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:31,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:31,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:31,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:31,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:31,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:31,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:31,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:31,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 01:34:31,776 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:31,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:31,779 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-31 01:34:31,781 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-31 01:34:31,808 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-31 01:34:31,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:31,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:31,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:31,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:31,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:31,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:31,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:31,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:31,831 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-31 01:34:31,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:31,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:31,832 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-31 01:34:31,833 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-31 01:34:31,834 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-31 01:34:31,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:31,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:31,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:31,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:31,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:31,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:31,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:31,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:31,862 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-31 01:34:31,862 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:31,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:31,863 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-31 01:34:31,864 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-31 01:34:31,866 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-31 01:34:31,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:31,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:31,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:31,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:31,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:31,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:31,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:31,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:31,905 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-31 01:34:31,905 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:31,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:31,909 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-31 01:34:31,910 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-31 01:34:31,911 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-31 01:34:31,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:31,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:31,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:31,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:31,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:31,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:31,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:31,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:31,963 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-31 01:34:31,963 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:31,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:31,964 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-31 01:34:31,972 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-31 01:34:31,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:31,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:31,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:31,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:31,984 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-31 01:34:31,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:34:31,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:34:32,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:32,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-31 01:34:32,023 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:32,024 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-31 01:34:32,025 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-31 01:34:32,026 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-31 01:34:32,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:32,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:32,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:32,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:32,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:34:32,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:34:32,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:32,069 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-31 01:34:32,070 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:32,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:32,077 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-31 01:34:32,080 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-31 01:34:32,081 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-31 01:34:32,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:32,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:32,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:32,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:32,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:34:32,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:34:32,108 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 01:34:32,133 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-08-31 01:34:32,133 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-08-31 01:34:32,134 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:32,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:32,137 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-31 01:34:32,165 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-31 01:34:32,165 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 01:34:32,186 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-08-31 01:34:32,186 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 01:34:32,187 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-31 01:34:32,205 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-31 01:34:32,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-08-31 01:34:32,317 INFO L297 tatePredicateManager]: 37 out of 40 supporting invariants were superfluous and have been removed [2021-08-31 01:34:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:32,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-31 01:34:32,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:34:32,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-08-31 01:34:32,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:32,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:32,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:32,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:32,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:32,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:32,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:32,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-31 01:34:32,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:34:32,783 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-31 01:34:32,786 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-31 01:34:32,786 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-31 01:34:33,002 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-31 01:34:33,003 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-31 01:34:33,003 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-31 01:34:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2021-08-31 01:34:33,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 3 letters. [2021-08-31 01:34:33,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:34:33,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 22 letters. Loop has 3 letters. [2021-08-31 01:34:33,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:34:33,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 6 letters. [2021-08-31 01:34:33,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:34:33,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 61 transitions. [2021-08-31 01:34:33,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-31 01:34:33,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 29 states and 34 transitions. [2021-08-31 01:34:33,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-31 01:34:33,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-31 01:34:33,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2021-08-31 01:34:33,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:33,006 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-08-31 01:34:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2021-08-31 01:34:33,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2021-08-31 01:34:33,007 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-31 01:34:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-08-31 01:34:33,007 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-08-31 01:34:33,007 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-08-31 01:34:33,007 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 01:34:33,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2021-08-31 01:34:33,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:33,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:33,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:33,008 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-31 01:34:33,008 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:33,008 INFO L791 eck$LassoCheckResult]: Stem: 1209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1210#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; 1224#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1220#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1221#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; 1222#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1223#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; 1225#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1226#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; 1232#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1215#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; 1216#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1228#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; 1211#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1212#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; 1230#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1217#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; 1218#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1229#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; 1213#L598-4 [2021-08-31 01:34:33,008 INFO L793 eck$LassoCheckResult]: Loop: 1213#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1214#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; 1231#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; 1213#L598-4 [2021-08-31 01:34:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:33,008 INFO L82 PathProgramCache]: Analyzing trace with hash 189281224, now seen corresponding path program 1 times [2021-08-31 01:34:33,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:33,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738548075] [2021-08-31 01:34:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:33,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:33,136 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-31 01:34:33,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:33,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738548075] [2021-08-31 01:34:33,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738548075] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:33,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:33,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-31 01:34:33,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741556820] [2021-08-31 01:34:33,136 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2021-08-31 01:34:33,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:33,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487577064] [2021-08-31 01:34:33,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:33,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:33,141 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:33,145 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:33,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:33,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-31 01:34:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-31 01:34:33,264 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-31 01:34:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:33,347 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-08-31 01:34:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-31 01:34:33,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2021-08-31 01:34:33,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:33,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2021-08-31 01:34:33,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-31 01:34:33,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-08-31 01:34:33,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2021-08-31 01:34:33,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:33,348 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-08-31 01:34:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2021-08-31 01:34:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2021-08-31 01:34:33,349 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-31 01:34:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-08-31 01:34:33,349 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-31 01:34:33,349 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-31 01:34:33,349 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 01:34:33,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2021-08-31 01:34:33,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:33,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:33,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:33,350 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-31 01:34:33,350 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:33,350 INFO L791 eck$LassoCheckResult]: Stem: 1281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1282#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; 1295#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1289#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1290#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; 1293#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1294#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; 1296#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1297#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; 1302#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1283#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; 1284#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1299#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; 1285#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1286#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; 1301#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1291#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; 1292#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1298#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; 1287#L598-4 [2021-08-31 01:34:33,350 INFO L793 eck$LassoCheckResult]: Loop: 1287#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1288#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; 1300#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; 1287#L598-4 [2021-08-31 01:34:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:33,350 INFO L82 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2021-08-31 01:34:33,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:33,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877143766] [2021-08-31 01:34:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:33,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:33,357 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:33,366 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2021-08-31 01:34:33,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:33,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564104553] [2021-08-31 01:34:33,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:33,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:33,371 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:33,378 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2021-08-31 01:34:33,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:33,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571442059] [2021-08-31 01:34:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:33,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:33,390 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:33,401 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:37,289 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:34:37,289 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:34:37,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:34:37,289 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:34:37,289 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:34:37,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:37,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:34:37,289 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:34:37,289 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration12_Lasso [2021-08-31 01:34:37,289 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:34:37,289 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:34:37,291 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-31 01:34:37,293 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-31 01:34:37,294 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-31 01:34:37,295 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-31 01:34:37,297 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-31 01:34:37,298 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-31 01:34:37,299 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-31 01:34:37,300 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-31 01:34:37,302 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-31 01:34:37,303 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-31 01:34:37,304 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-31 01:34:37,619 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-31 01:34:37,621 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-31 01:34:37,622 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-31 01:34:37,638 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-31 01:34:37,639 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-31 01:34:37,640 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-31 01:34:37,641 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-31 01:34:37,643 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-31 01:34:37,644 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-31 01:34:37,645 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-31 01:34:37,646 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-31 01:34:37,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,653 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-31 01:34:37,654 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-31 01:34:37,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,661 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-31 01:34:37,662 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-31 01:34:37,664 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-31 01:34:37,665 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-31 01:34:37,666 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-31 01:34:37,667 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-31 01:34:37,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,672 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-31 01:34:37,673 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-31 01:34:37,674 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-31 01:34:37,675 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-31 01:34:37,676 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-31 01:34:37,682 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-31 01:34:37,684 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-31 01:34:37,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,686 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-31 01:34:37,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:34:37,697 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-31 01:34:37,699 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-31 01:34:37,700 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-31 01:34:38,075 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:34:38,075 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:34:38,075 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,076 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-31 01:34:38,077 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-31 01:34:38,078 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-31 01:34:38,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,102 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-31 01:34:38,102 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,103 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-31 01:34:38,103 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-31 01:34:38,104 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-31 01:34:38,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,126 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-31 01:34:38,126 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,128 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-31 01:34:38,128 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-31 01:34:38,129 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-31 01:34:38,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,155 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-31 01:34:38,155 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,156 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-31 01:34:38,156 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-31 01:34:38,158 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-31 01:34:38,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,180 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-31 01:34:38,181 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,182 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-31 01:34:38,183 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-31 01:34:38,184 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-31 01:34:38,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,206 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-31 01:34:38,206 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,207 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-31 01:34:38,207 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-31 01:34:38,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:34:38,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,235 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-31 01:34:38,236 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,236 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-31 01:34:38,237 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-31 01:34:38,238 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-31 01:34:38,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-08-31 01:34:38,261 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,261 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-31 01:34:38,264 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-31 01:34:38,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:34:38,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,289 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-31 01:34:38,289 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,289 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-31 01:34:38,293 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-31 01:34:38,294 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-31 01:34:38,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,316 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-31 01:34:38,316 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,317 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-31 01:34:38,324 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-31 01:34:38,324 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-31 01:34:38,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:34:38,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:34:38,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:34:38,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,350 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-31 01:34:38,351 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,351 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-31 01:34:38,352 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-31 01:34:38,353 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-31 01:34:38,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:34:38,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:34:38,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:34:38,390 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-31 01:34:38,390 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,391 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-31 01:34:38,391 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-31 01:34:38,392 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-31 01:34:38,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:34:38,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:34:38,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:34:38,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:34:38,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:34:38,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:34:38,406 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 01:34:38,423 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-08-31 01:34:38,423 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-08-31 01:34:38,423 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:34:38,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:34:38,424 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-31 01:34:38,424 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-31 01:34:38,425 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 01:34:38,432 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-08-31 01:34:38,432 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 01:34:38,432 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-31 01:34:38,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-08-31 01:34:38,534 INFO L297 tatePredicateManager]: 37 out of 40 supporting invariants were superfluous and have been removed [2021-08-31 01:34:38,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:38,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-31 01:34:38,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:34:38,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-08-31 01:34:38,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-31 01:34:38,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:38,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:38,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:38,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:38,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:38,807 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-31 01:34:38,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:38,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-31 01:34:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:38,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-31 01:34:38,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:34:38,972 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-31 01:34:38,973 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-31 01:34:38,973 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-31 01:34:39,124 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 31 states and 37 transitions. Complement of second has 15 states. [2021-08-31 01:34:39,125 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-31 01:34:39,125 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-31 01:34:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2021-08-31 01:34:39,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 19 letters. Loop has 3 letters. [2021-08-31 01:34:39,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:34:39,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 22 letters. Loop has 3 letters. [2021-08-31 01:34:39,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:34:39,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 19 letters. Loop has 6 letters. [2021-08-31 01:34:39,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:34:39,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2021-08-31 01:34:39,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:39,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 27 transitions. [2021-08-31 01:34:39,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-08-31 01:34:39,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-08-31 01:34:39,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2021-08-31 01:34:39,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:39,127 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-08-31 01:34:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2021-08-31 01:34:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-08-31 01:34:39,128 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-31 01:34:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-08-31 01:34:39,128 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-08-31 01:34:39,129 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-08-31 01:34:39,129 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-31 01:34:39,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2021-08-31 01:34:39,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:34:39,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:34:39,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:34:39,129 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-31 01:34:39,129 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:34:39,130 INFO L791 eck$LassoCheckResult]: Stem: 1615#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1616#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; 1627#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1628#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; 1630#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1631#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; 1636#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1619#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; 1620#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1633#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; 1621#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1622#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; 1635#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1625#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; 1626#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1632#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; 1617#L598-4 [2021-08-31 01:34:39,130 INFO L793 eck$LassoCheckResult]: Loop: 1617#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1618#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; 1634#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; 1617#L598-4 [2021-08-31 01:34:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2021-08-31 01:34:39,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:39,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602730517] [2021-08-31 01:34:39,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:39,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:34:39,277 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-31 01:34:39,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:34:39,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602730517] [2021-08-31 01:34:39,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602730517] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:34:39,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:34:39,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-31 01:34:39,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914208829] [2021-08-31 01:34:39,279 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:34:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:34:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2021-08-31 01:34:39,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:34:39,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913892699] [2021-08-31 01:34:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:34:39,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:34:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:39,295 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:34:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:34:39,299 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:34:39,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:34:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-31 01:34:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-08-31 01:34:39,423 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-31 01:34:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:34:39,491 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2021-08-31 01:34:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-31 01:34:39,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2021-08-31 01:34:39,492 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 01:34:39,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2021-08-31 01:34:39,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 01:34:39,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 01:34:39,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 01:34:39,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:34:39,492 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 01:34:39,493 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 01:34:39,493 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 01:34:39,493 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-31 01:34:39,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-31 01:34:39,493 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 01:34:39,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-31 01:34:39,495 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 01:34:39,498 INFO L158 Benchmark]: Toolchain (without parser) took 16280.60ms. Allocated memory was 60.8MB in the beginning and 109.1MB in the end (delta: 48.2MB). Free memory was 38.8MB in the beginning and 60.7MB in the end (delta: -21.9MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2021-08-31 01:34:39,498 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory was 41.9MB in the beginning and 41.9MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 01:34:39,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.56ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 39.3MB in the end (delta: -707.3kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-08-31 01:34:39,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.51ms. Allocated memory is still 60.8MB. Free memory was 39.1MB in the beginning and 37.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 01:34:39,499 INFO L158 Benchmark]: Boogie Preprocessor took 16.63ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 35.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 01:34:39,499 INFO L158 Benchmark]: RCFGBuilder took 299.24ms. Allocated memory is still 60.8MB. Free memory was 35.5MB in the beginning and 40.0MB in the end (delta: -4.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2021-08-31 01:34:39,499 INFO L158 Benchmark]: BuchiAutomizer took 15649.47ms. Allocated memory was 60.8MB in the beginning and 109.1MB in the end (delta: 48.2MB). Free memory was 40.0MB in the beginning and 60.7MB in the end (delta: -20.8MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2021-08-31 01:34:39,500 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.14ms. Allocated memory is still 60.8MB. Free memory was 41.9MB in the beginning and 41.9MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.56ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 39.3MB in the end (delta: -707.3kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.51ms. Allocated memory is still 60.8MB. Free memory was 39.1MB in the beginning and 37.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.63ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 35.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 299.24ms. Allocated memory is still 60.8MB. Free memory was 35.5MB in the beginning and 40.0MB in the end (delta: -4.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 15649.47ms. Allocated memory was 60.8MB in the beginning and 109.1MB in the end (delta: 48.2MB). Free memory was 40.0MB in the beginning and 60.7MB in the end (delta: -20.8MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 01:34:39,523 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...