./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/gcd1-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 160024a3cc4acfbc7213f984e87ef0c708b94aaf ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@43b35eb7 --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:34:15,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:34:15,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:34:15,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:34:15,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:34:15,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:34:15,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:34:15,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:34:15,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:34:15,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:34:15,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:34:15,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:34:15,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:34:15,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:34:15,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:34:15,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:34:15,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:34:15,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:34:15,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:34:15,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:34:15,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:34:15,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:34:15,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:34:15,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:34:15,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:34:15,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:34:15,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:34:15,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:34:15,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:34:15,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:34:15,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:34:15,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:34:15,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:34:15,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:34:15,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:34:15,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:34:15,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:34:15,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:34:15,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:34:15,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:34:15,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:34:15,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:34:15,284 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:34:15,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:34:15,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:34:15,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:34:15,290 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:34:15,290 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:34:15,291 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:34:15,291 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:34:15,291 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:34:15,291 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:34:15,292 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:34:15,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:34:15,292 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:34:15,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:34:15,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:34:15,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:34:15,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:34:15,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:34:15,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:34:15,293 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:34:15,294 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:34:15,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:34:15,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:34:15,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:34:15,295 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:34:15,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:34:15,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:34:15,296 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:34:15,296 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:34:15,297 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:34:15,297 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 160024a3cc4acfbc7213f984e87ef0c708b94aaf [2019-11-28 20:34:15,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:34:15,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:34:15,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:34:15,635 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:34:15,636 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:34:15,637 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca.i [2019-11-28 20:34:15,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/879d8360d/bcdedb5c63de492eb720e2a2153c3436/FLAG7d49b0937 [2019-11-28 20:34:16,224 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:34:16,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/gcd1-alloca.i [2019-11-28 20:34:16,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/879d8360d/bcdedb5c63de492eb720e2a2153c3436/FLAG7d49b0937 [2019-11-28 20:34:16,589 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/879d8360d/bcdedb5c63de492eb720e2a2153c3436 [2019-11-28 20:34:16,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:34:16,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:34:16,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:16,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:34:16,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:34:16,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:16" (1/1) ... [2019-11-28 20:34:16,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26041f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:16, skipping insertion in model container [2019-11-28 20:34:16,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:16" (1/1) ... [2019-11-28 20:34:16,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:34:16,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:34:17,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:17,098 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:34:17,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:17,193 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:34:17,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17 WrapperNode [2019-11-28 20:34:17,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:17,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:17,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:34:17,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:34:17,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... [2019-11-28 20:34:17,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... [2019-11-28 20:34:17,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:17,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:34:17,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:34:17,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:34:17,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... [2019-11-28 20:34:17,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... [2019-11-28 20:34:17,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... [2019-11-28 20:34:17,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... [2019-11-28 20:34:17,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... [2019-11-28 20:34:17,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... [2019-11-28 20:34:17,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... [2019-11-28 20:34:17,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:34:17,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:34:17,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:34:17,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:34:17,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:34:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:34:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:34:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:34:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:34:17,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:34:17,656 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:34:17,656 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:34:17,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:17 BoogieIcfgContainer [2019-11-28 20:34:17,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:34:17,658 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:34:17,658 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:34:17,662 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:34:17,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:17,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:34:16" (1/3) ... [2019-11-28 20:34:17,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d1df039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:17, skipping insertion in model container [2019-11-28 20:34:17,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:17,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:17" (2/3) ... [2019-11-28 20:34:17,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d1df039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:17, skipping insertion in model container [2019-11-28 20:34:17,666 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:17,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:17" (3/3) ... [2019-11-28 20:34:17,668 INFO L371 chiAutomizerObserver]: Analyzing ICFG gcd1-alloca.i [2019-11-28 20:34:17,716 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:34:17,717 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:34:17,717 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:34:17,718 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:34:17,718 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:34:17,718 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:34:17,719 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:34:17,719 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:34:17,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:34:17,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:17,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:17,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:17,758 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:17,758 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:17,758 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:34:17,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:34:17,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:17,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:17,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:17,760 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:17,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:17,767 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 9#L553true assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 15#L553-2true call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 5#L554true assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 10#L555-2true [2019-11-28 20:34:17,767 INFO L796 eck$LassoCheckResult]: Loop: 10#L555-2true call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 4#L555true assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 6#L557-3true assume !true; 11#L557-4true call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 10#L555-2true [2019-11-28 20:34:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:17,772 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 20:34:17,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:17,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304588698] [2019-11-28 20:34:17,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:17,943 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:17,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1513768, now seen corresponding path program 1 times [2019-11-28 20:34:17,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:17,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667388798] [2019-11-28 20:34:17,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:17,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667388798] [2019-11-28 20:34:17,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:17,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:34:17,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842906229] [2019-11-28 20:34:17,994 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:17,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:18,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:34:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:34:18,013 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-11-28 20:34:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:18,019 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-28 20:34:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:34:18,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-28 20:34:18,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:18,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2019-11-28 20:34:18,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:34:18,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:34:18,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-28 20:34:18,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:18,029 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 20:34:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-28 20:34:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 20:34:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 20:34:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-28 20:34:18,050 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 20:34:18,050 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 20:34:18,051 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:34:18,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-28 20:34:18,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:18,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:18,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:18,052 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:18,052 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:18,053 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 39#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 42#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 45#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 41#L555-2 [2019-11-28 20:34:18,053 INFO L796 eck$LassoCheckResult]: Loop: 41#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 43#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 47#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 46#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 40#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 41#L555-2 [2019-11-28 20:34:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 2 times [2019-11-28 20:34:18,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:18,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036468913] [2019-11-28 20:34:18,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:18,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:18,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:18,103 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 1 times [2019-11-28 20:34:18,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:18,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659846506] [2019-11-28 20:34:18,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:18,150 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:18,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1985425099, now seen corresponding path program 1 times [2019-11-28 20:34:18,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:18,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051989997] [2019-11-28 20:34:18,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:18,221 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:18,337 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 20:34:18,843 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-11-28 20:34:18,996 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 20:34:19,011 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:19,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:19,012 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:19,012 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:19,013 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:19,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:19,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:19,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:19,014 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca.i_Iteration2_Lasso [2019-11-28 20:34:19,014 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:19,014 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:19,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,510 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-28 20:34:19,673 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-28 20:34:19,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:19,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:20,273 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:20,278 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:20,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:20,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:20,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:20,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:20,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:20,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:20,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:20,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:20,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:20,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:20,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:20,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:20,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:20,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:20,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:20,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:20,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:20,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:20,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:20,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:20,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:20,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:20,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:20,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:20,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:20,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:20,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:20,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:20,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:20,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:20,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:20,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:20,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:20,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:20,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:20,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:20,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:20,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:20,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:20,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:20,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:20,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:20,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:20,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,665 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:20,691 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 20:34:20,691 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:20,727 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:34:20,733 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:34:20,733 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:20,734 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1 Supporting invariants [] [2019-11-28 20:34:20,891 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-28 20:34:20,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:34:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:20,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:34:20,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:21,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:21,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-28 20:34:21,034 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:21,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:21,049 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:34:21,049 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-28 20:34:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:21,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:34:21,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:21,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:21,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 64 [2019-11-28 20:34:21,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:21,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:21,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:21,200 INFO L614 ElimStorePlain]: treesize reduction 69, result has 37.8 percent of original size [2019-11-28 20:34:21,200 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:34:21,201 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:42 [2019-11-28 20:34:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:21,330 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-28 20:34:21,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-28 20:34:21,472 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 31 states and 38 transitions. Complement of second has 14 states. [2019-11-28 20:34:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:34:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2019-11-28 20:34:21,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-28 20:34:21,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:21,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-28 20:34:21,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:21,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 20:34:21,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:21,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-28 20:34:21,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:34:21,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 34 transitions. [2019-11-28 20:34:21,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 20:34:21,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 20:34:21,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-28 20:34:21,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:21,486 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 20:34:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-28 20:34:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2019-11-28 20:34:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:34:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 20:34:21,490 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 20:34:21,491 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 20:34:21,492 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:34:21,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-28 20:34:21,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:21,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:21,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:21,494 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:21,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:21,494 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 248#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 249#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 250#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 259#L554 assume gcd_#t~mem7 < 0;havoc gcd_#t~mem7;call gcd_#t~mem8 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(-gcd_#t~mem8, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem8; 251#L555-2 [2019-11-28 20:34:21,495 INFO L796 eck$LassoCheckResult]: Loop: 251#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 252#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 261#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 266#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 256#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 251#L555-2 [2019-11-28 20:34:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2019-11-28 20:34:21,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:21,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330644984] [2019-11-28 20:34:21,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:21,585 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:21,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:21,586 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 2 times [2019-11-28 20:34:21,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:21,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797045884] [2019-11-28 20:34:21,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:21,630 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2042683401, now seen corresponding path program 1 times [2019-11-28 20:34:21,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:21,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030976879] [2019-11-28 20:34:21,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:21,684 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:22,129 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-11-28 20:34:22,252 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 20:34:22,256 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:22,256 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:22,256 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:22,256 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:22,256 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:22,256 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:22,257 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:22,257 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:22,257 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca.i_Iteration3_Lasso [2019-11-28 20:34:22,257 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:22,257 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:22,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,653 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-11-28 20:34:22,818 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-28 20:34:22,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:22,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:23,386 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:23,386 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:23,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:23,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:23,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:23,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:23,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:23,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:23,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:23,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:23,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:23,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:23,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:23,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:23,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:23,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:23,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:23,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:23,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:23,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:23,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:23,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:23,889 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:23,914 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 20:34:23,914 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:23,922 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:23,925 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:34:23,926 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:23,926 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2 Supporting invariants [] [2019-11-28 20:34:24,021 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-28 20:34:24,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:34:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:24,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:34:24,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:24,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:24,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-28 20:34:24,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:24,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:24,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:34:24,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-28 20:34:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:24,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:34:24,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:24,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:24,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 64 [2019-11-28 20:34:24,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:24,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:24,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:24,200 INFO L614 ElimStorePlain]: treesize reduction 91, result has 31.6 percent of original size [2019-11-28 20:34:24,201 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:34:24,201 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:42 [2019-11-28 20:34:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:24,301 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-28 20:34:24,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-11-28 20:34:24,422 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 40 states and 49 transitions. Complement of second has 14 states. [2019-11-28 20:34:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:34:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2019-11-28 20:34:24,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-28 20:34:24,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:24,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-28 20:34:24,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:24,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 20:34:24,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:24,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2019-11-28 20:34:24,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 20:34:24,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 45 transitions. [2019-11-28 20:34:24,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 20:34:24,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 20:34:24,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-28 20:34:24,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:24,430 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-28 20:34:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-28 20:34:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2019-11-28 20:34:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:34:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 20:34:24,433 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 20:34:24,434 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 20:34:24,434 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:34:24,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-28 20:34:24,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:24,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:24,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:24,435 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:24,436 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:34:24,436 INFO L794 eck$LassoCheckResult]: Stem: 486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 476#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 477#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 485#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 487#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 493#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 484#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 494#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 488#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 489#L557-3 [2019-11-28 20:34:24,436 INFO L796 eck$LassoCheckResult]: Loop: 489#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 492#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 489#L557-3 [2019-11-28 20:34:24,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:24,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1182880019, now seen corresponding path program 1 times [2019-11-28 20:34:24,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:24,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189185423] [2019-11-28 20:34:24,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1894, now seen corresponding path program 1 times [2019-11-28 20:34:24,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:24,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18008469] [2019-11-28 20:34:24,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,482 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634248, now seen corresponding path program 2 times [2019-11-28 20:34:24,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:24,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122834676] [2019-11-28 20:34:24,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,521 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:25,105 WARN L192 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 110 [2019-11-28 20:34:25,256 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-28 20:34:25,259 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:25,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:25,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:25,259 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:25,260 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:25,260 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,260 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:25,260 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:25,260 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca.i_Iteration4_Lasso [2019-11-28 20:34:25,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:25,261 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:25,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,627 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-11-28 20:34:25,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,238 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:26,239 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:26,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:26,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:26,495 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:34:26,495 INFO L444 ModelExtractionUtils]: 9 out of 31 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,500 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:34:26,502 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:34:26,502 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:26,502 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 - 1 >= 0] [2019-11-28 20:34:26,571 INFO L297 tatePredicateManager]: 17 out of 21 supporting invariants were superfluous and have been removed [2019-11-28 20:34:26,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:34:26,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:26,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 20:34:26,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:26,633 INFO L377 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 [2019-11-28 20:34:26,634 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:26,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:26,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:26,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-11-28 20:34:26,666 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:26,708 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.4 percent of original size [2019-11-28 20:34:26,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:34:26,709 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:12 [2019-11-28 20:34:26,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:34:26,765 INFO L343 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2019-11-28 20:34:26,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2019-11-28 20:34:26,767 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:26,789 INFO L614 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2019-11-28 20:34:26,790 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:34:26,790 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2019-11-28 20:34:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:26,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:34:26,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:26,842 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-28 20:34:26,842 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-28 20:34:26,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 25 states and 32 transitions. Complement of second has 10 states. [2019-11-28 20:34:26,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:34:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-11-28 20:34:26,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 20:34:26,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:26,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-28 20:34:26,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:26,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 20:34:26,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:26,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-28 20:34:26,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:26,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2019-11-28 20:34:26,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:34:26,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 20:34:26,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2019-11-28 20:34:26,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:26,927 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-28 20:34:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2019-11-28 20:34:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-28 20:34:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 20:34:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-28 20:34:26,929 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 20:34:26,929 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 20:34:26,929 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:34:26,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-28 20:34:26,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:26,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:26,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:26,932 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:26,932 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:26,932 INFO L794 eck$LassoCheckResult]: Stem: 684#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 674#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 675#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 683#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 685#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 693#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 682#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 689#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 696#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 695#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 686#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 676#L557-4 [2019-11-28 20:34:26,932 INFO L796 eck$LassoCheckResult]: Loop: 676#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 677#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 680#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 691#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 692#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 676#L557-4 [2019-11-28 20:34:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 1 times [2019-11-28 20:34:26,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:26,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824707672] [2019-11-28 20:34:26,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:26,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:26,964 INFO L82 PathProgramCache]: Analyzing trace with hash 64312973, now seen corresponding path program 3 times [2019-11-28 20:34:26,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:26,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398965934] [2019-11-28 20:34:26,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,977 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:26,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603336, now seen corresponding path program 1 times [2019-11-28 20:34:26,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:26,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713561855] [2019-11-28 20:34:26,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:27,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713561855] [2019-11-28 20:34:27,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577478947] [2019-11-28 20:34:27,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:34:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:27,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 20:34:27,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:27,306 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:27,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 47 [2019-11-28 20:34:27,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,313 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:34:27,347 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-11-28 20:34:27,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,350 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:34:27,351 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:45 [2019-11-28 20:34:27,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,460 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:27,613 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-28 20:34:27,614 INFO L343 Elim1Store]: treesize reduction 52, result has 62.0 percent of original size [2019-11-28 20:34:27,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 120 [2019-11-28 20:34:27,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:27,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:27,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:27,943 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@43b35eb7 [2019-11-28 20:34:27,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:34:27,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-28 20:34:27,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260705412] [2019-11-28 20:34:28,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:28,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:34:28,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:34:28,044 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 10 states. [2019-11-28 20:34:28,045 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@43b35eb7 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 20:34:28,051 INFO L168 Benchmark]: Toolchain (without parser) took 11458.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.4 MB). Free memory was 961.7 MB in the beginning and 1.3 GB in the end (delta: -337.5 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:28,052 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:28,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:28,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:28,054 INFO L168 Benchmark]: Boogie Preprocessor took 29.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:28,054 INFO L168 Benchmark]: RCFGBuilder took 386.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:28,055 INFO L168 Benchmark]: BuchiAutomizer took 10391.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:28,058 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 600.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 386.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10391.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@43b35eb7 de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@43b35eb7: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...