./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 8d1516397c9e3fe5ce9ef1c287c66a5cdc207f67 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 05:56:08,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:56:08,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:56:08,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:56:08,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:56:08,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:56:08,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:56:08,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:56:08,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:56:08,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:56:08,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:56:08,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:56:08,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:56:08,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:56:08,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:56:08,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:56:08,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:56:08,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:56:08,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:56:08,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:56:08,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:56:08,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:56:08,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:56:08,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:56:08,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:56:08,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:56:08,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:56:08,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:56:08,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:56:08,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:56:08,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:56:08,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:56:08,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:56:08,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:56:08,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:56:08,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:56:08,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:56:08,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:56:08,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:56:08,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:56:08,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:56:08,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 05:56:08,482 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:56:08,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:56:08,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:56:08,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:56:08,487 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:56:08,487 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:56:08,487 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:56:08,488 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:56:08,488 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:56:08,488 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:56:08,490 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:56:08,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:56:08,490 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:56:08,490 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:56:08,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:56:08,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:56:08,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:56:08,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:56:08,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:56:08,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:56:08,492 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:56:08,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:56:08,492 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:56:08,493 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:56:08,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:56:08,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:56:08,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:56:08,494 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:56:08,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:56:08,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:56:08,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:56:08,495 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:56:08,496 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:56:08,497 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d1516397c9e3fe5ce9ef1c287c66a5cdc207f67 [2020-10-26 05:56:08,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:56:08,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:56:08,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:56:08,924 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:56:08,927 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:56:08,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2020-10-26 05:56:09,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdf8011a/4e2b40fc0c5c4b09bbf25786bc1e5350/FLAG912702230 [2020-10-26 05:56:09,798 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:56:09,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2020-10-26 05:56:09,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdf8011a/4e2b40fc0c5c4b09bbf25786bc1e5350/FLAG912702230 [2020-10-26 05:56:09,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdf8011a/4e2b40fc0c5c4b09bbf25786bc1e5350 [2020-10-26 05:56:09,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:56:09,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:56:09,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:56:09,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:56:09,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:56:09,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:56:09" (1/1) ... [2020-10-26 05:56:09,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f56d63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:09, skipping insertion in model container [2020-10-26 05:56:09,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:56:09" (1/1) ... [2020-10-26 05:56:10,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:56:10,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:56:10,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:56:10,444 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:56:10,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:56:10,552 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:56:10,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10 WrapperNode [2020-10-26 05:56:10,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:56:10,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:56:10,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:56:10,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:56:10,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (1/1) ... [2020-10-26 05:56:10,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (1/1) ... [2020-10-26 05:56:10,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:56:10,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:56:10,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:56:10,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:56:10,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (1/1) ... [2020-10-26 05:56:10,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (1/1) ... [2020-10-26 05:56:10,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (1/1) ... [2020-10-26 05:56:10,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (1/1) ... [2020-10-26 05:56:10,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (1/1) ... [2020-10-26 05:56:10,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (1/1) ... [2020-10-26 05:56:10,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (1/1) ... [2020-10-26 05:56:10,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:56:10,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:56:10,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:56:10,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:56:10,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (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 [2020-10-26 05:56:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:56:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:56:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:56:10,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:56:11,924 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:56:11,924 INFO L298 CfgBuilder]: Removed 31 assume(true) statements. [2020-10-26 05:56:11,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:56:11 BoogieIcfgContainer [2020-10-26 05:56:11,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:56:11,928 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:56:11,928 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:56:11,932 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:56:11,933 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:56:11,933 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:56:09" (1/3) ... [2020-10-26 05:56:11,934 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7336fbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:56:11, skipping insertion in model container [2020-10-26 05:56:11,934 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:56:11,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:10" (2/3) ... [2020-10-26 05:56:11,935 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7336fbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:56:11, skipping insertion in model container [2020-10-26 05:56:11,935 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:56:11,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:56:11" (3/3) ... [2020-10-26 05:56:11,937 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2020-10-26 05:56:11,988 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:56:11,988 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:56:11,988 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:56:11,988 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:56:11,988 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:56:11,988 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:56:11,989 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:56:11,989 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:56:12,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states. [2020-10-26 05:56:12,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-10-26 05:56:12,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:12,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:12,053 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:12,053 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:12,053 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:56:12,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states. [2020-10-26 05:56:12,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-10-26 05:56:12,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:12,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:12,066 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:12,067 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:12,076 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 13#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 97#L344true assume !(0 == ~r1~0);init_~tmp~0 := 0; 100#L344-1true init_#res := init_~tmp~0; 99#L589true main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 71#L69true assume !(0 == assume_abort_if_not_~cond); 149#L68true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 145#L679-2true [2020-10-26 05:56:12,077 INFO L796 eck$LassoCheckResult]: Loop: 145#L679-2true assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 28#L139true assume !(0 != ~mode1~0 % 256); 41#L155true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 49#L155-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 12#L139-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 135#L167true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 137#L170true assume !(node2_~m2~0 != ~nomsg~0); 118#L170-1true ~mode2~0 := 0; 134#L167-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 138#L192true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 129#L195true assume !(node3_~m3~0 != ~nomsg~0); 127#L195-1true ~mode3~0 := 0; 116#L192-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 130#L217true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 101#L220true assume !(node4_~m4~0 != ~nomsg~0); 98#L220-1true ~mode4~0 := 0; 126#L217-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 102#L242true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 104#L245true assume !(node5_~m5~0 != ~nomsg~0); 74#L245-1true ~mode5~0 := 0; 96#L242-2true havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 106#L267true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 89#L270true assume !(node6_~m6~0 != ~nomsg~0); 85#L270-1true ~mode6~0 := 0; 72#L267-2true havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 90#L292true assume !(0 != ~mode7~0 % 256); 128#L305true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite13 := ~send7~0; 131#L305-2true ~p7_new~0 := (if node7_#t~ite13 % 256 <= 127 then node7_#t~ite13 % 256 else node7_#t~ite13 % 256 - 256);havoc node7_#t~ite13;~mode7~0 := 1; 83#L292-2true havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 67#L317true assume !(0 != ~mode8~0 % 256); 119#L330true assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite14 := ~send8~0; 107#L330-2true ~p8_new~0 := (if node8_#t~ite14 % 256 <= 127 then node8_#t~ite14 % 256 else node8_#t~ite14 % 256 - 256);havoc node8_#t~ite14;~mode8~0 := 1; 68#L317-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 117#L597true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 103#L597-1true check_#res := check_~tmp~1; 64#L617true main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 110#L718true assume !(0 == assert_~arg % 256); 76#L713true main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 145#L679-2true [2020-10-26 05:56:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2144605008, now seen corresponding path program 1 times [2020-10-26 05:56:12,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:12,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826935366] [2020-10-26 05:56:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:56:12,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826935366] [2020-10-26 05:56:12,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:12,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:56:12,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686636915] [2020-10-26 05:56:12,412 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:56:12,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1842952597, now seen corresponding path program 1 times [2020-10-26 05:56:12,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:12,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324555321] [2020-10-26 05:56:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:56:12,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324555321] [2020-10-26 05:56:12,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:12,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:56:12,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677354409] [2020-10-26 05:56:12,692 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:56:12,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:56:12,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:56:12,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:56:12,713 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 5 states. [2020-10-26 05:56:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:56:13,129 INFO L93 Difference]: Finished difference Result 149 states and 254 transitions. [2020-10-26 05:56:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:56:13,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 254 transitions. [2020-10-26 05:56:13,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-26 05:56:13,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 141 states and 186 transitions. [2020-10-26 05:56:13,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-10-26 05:56:13,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-10-26 05:56:13,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 186 transitions. [2020-10-26 05:56:13,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:56:13,150 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-10-26 05:56:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 186 transitions. [2020-10-26 05:56:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-26 05:56:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-26 05:56:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2020-10-26 05:56:13,192 INFO L714 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-10-26 05:56:13,192 INFO L594 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-10-26 05:56:13,192 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:56:13,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 186 transitions. [2020-10-26 05:56:13,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-26 05:56:13,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:13,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:13,199 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:13,200 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:13,201 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 338#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 339#L344 assume 0 == ~r1~0; 382#L345 assume ~id1~0 >= 0; 383#L346 assume 0 == ~st1~0; 437#L347 assume ~send1~0 == ~id1~0; 372#L348 assume 0 == ~mode1~0 % 256; 373#L349 assume ~id2~0 >= 0; 415#L350 assume 0 == ~st2~0; 354#L351 assume ~send2~0 == ~id2~0; 355#L352 assume 0 == ~mode2~0 % 256; 406#L353 assume ~id3~0 >= 0; 324#L354 assume 0 == ~st3~0; 325#L355 assume ~send3~0 == ~id3~0; 377#L356 assume 0 == ~mode3~0 % 256; 378#L357 assume ~id4~0 >= 0; 436#L358 assume 0 == ~st4~0; 370#L359 assume ~send4~0 == ~id4~0; 371#L360 assume 0 == ~mode4~0 % 256; 413#L361 assume ~id5~0 >= 0; 352#L362 assume 0 == ~st5~0; 353#L363 assume ~send5~0 == ~id5~0; 405#L364 assume 0 == ~mode5~0 % 256; 322#L365 assume ~id6~0 >= 0; 323#L366 assume 0 == ~st6~0; 398#L367 assume ~send6~0 == ~id6~0; 399#L368 assume 0 == ~mode6~0 % 256; 435#L369 assume ~id7~0 >= 0; 368#L370 assume 0 == ~st7~0; 369#L371 assume ~send7~0 == ~id7~0; 410#L372 assume 0 == ~mode7~0 % 256; 350#L373 assume ~id8~0 >= 0; 351#L374 assume 0 == ~st8~0; 403#L375 assume ~send8~0 == ~id8~0; 318#L376 assume 0 == ~mode8~0 % 256; 319#L377 assume ~id1~0 != ~id2~0; 396#L378 assume ~id1~0 != ~id3~0; 397#L379 assume ~id1~0 != ~id4~0; 434#L380 assume ~id1~0 != ~id5~0; 366#L381 assume ~id1~0 != ~id6~0; 367#L382 assume ~id1~0 != ~id7~0; 428#L383 assume ~id1~0 != ~id8~0; 346#L384 assume ~id2~0 != ~id3~0; 347#L385 assume ~id2~0 != ~id4~0; 402#L386 assume ~id2~0 != ~id5~0; 316#L387 assume ~id2~0 != ~id6~0; 317#L388 assume ~id2~0 != ~id7~0; 394#L389 assume ~id2~0 != ~id8~0; 395#L390 assume ~id3~0 != ~id4~0; 433#L391 assume ~id3~0 != ~id5~0; 361#L392 assume ~id3~0 != ~id6~0; 362#L393 assume ~id3~0 != ~id7~0; 426#L394 assume ~id3~0 != ~id8~0; 344#L395 assume ~id4~0 != ~id5~0; 345#L396 assume ~id4~0 != ~id6~0; 401#L397 assume ~id4~0 != ~id7~0; 314#L398 assume ~id4~0 != ~id8~0; 315#L399 assume ~id5~0 != ~id6~0; 392#L400 assume ~id5~0 != ~id7~0; 393#L401 assume ~id5~0 != ~id8~0; 432#L402 assume ~id6~0 != ~id7~0; 357#L403 assume ~id6~0 != ~id8~0; 358#L404 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 443#L344-1 init_#res := init_~tmp~0; 441#L589 main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 422#L69 assume !(0 == assume_abort_if_not_~cond); 423#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 430#L679-2 [2020-10-26 05:56:13,201 INFO L796 eck$LassoCheckResult]: Loop: 430#L679-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 363#L139 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 364#L143 assume !(node1_~m1~0 != ~nomsg~0); 349#L143-1 ~mode1~0 := 0; 334#L139-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 335#L167 assume !(0 != ~mode2~0 % 256); 356#L180 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite8 := ~p2_new~0; 342#L180-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 343#L167-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 452#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 451#L195 assume !(node3_~m3~0 != ~nomsg~0); 387#L195-1 ~mode3~0 := 0; 360#L192-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 449#L217 assume !(0 != ~mode4~0 % 256); 320#L230 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 321#L230-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 340#L217-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 444#L242 assume !(0 != ~mode5~0 % 256); 336#L255 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 337#L255-2 ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 427#L242-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 440#L267 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 438#L270 assume !(node6_~m6~0 != ~nomsg~0); 327#L270-1 ~mode6~0 := 0; 424#L267-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 425#L292 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 404#L295 assume !(node7_~m7~0 != ~nomsg~0); 332#L295-1 ~mode7~0 := 0; 400#L292-2 havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 416#L317 assume !(0 != ~mode8~0 % 256); 417#L330 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite14 := ~send8~0; 448#L330-2 ~p8_new~0 := (if node8_#t~ite14 % 256 <= 127 then node8_#t~ite14 % 256 else node8_#t~ite14 % 256 - 256);havoc node8_#t~ite14;~mode8~0 := 1; 409#L317-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 418#L597 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 380#L597-1 check_#res := check_~tmp~1; 411#L617 main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 412#L718 assume !(0 == assert_~arg % 256); 429#L713 main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 430#L679-2 [2020-10-26 05:56:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 1 times [2020-10-26 05:56:13,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:13,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560629850] [2020-10-26 05:56:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:13,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:13,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:13,476 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:56:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash -466130273, now seen corresponding path program 1 times [2020-10-26 05:56:13,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:13,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445542291] [2020-10-26 05:56:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:56:13,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445542291] [2020-10-26 05:56:13,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:13,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:56:13,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116475773] [2020-10-26 05:56:13,623 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:56:13,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:56:13,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:56:13,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:56:13,625 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. cyclomatic complexity: 46 Second operand 5 states. [2020-10-26 05:56:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:56:13,721 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2020-10-26 05:56:13,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:56:13,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 188 transitions. [2020-10-26 05:56:13,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-26 05:56:13,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 141 states and 183 transitions. [2020-10-26 05:56:13,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-10-26 05:56:13,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-10-26 05:56:13,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 183 transitions. [2020-10-26 05:56:13,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:56:13,731 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-10-26 05:56:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 183 transitions. [2020-10-26 05:56:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-26 05:56:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-26 05:56:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2020-10-26 05:56:13,741 INFO L714 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-10-26 05:56:13,741 INFO L594 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-10-26 05:56:13,742 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:56:13,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 183 transitions. [2020-10-26 05:56:13,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-26 05:56:13,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:13,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:13,747 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:13,747 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:13,748 INFO L794 eck$LassoCheckResult]: Stem: 743#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 635#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 636#L344 assume 0 == ~r1~0; 678#L345 assume ~id1~0 >= 0; 679#L346 assume 0 == ~st1~0; 734#L347 assume ~send1~0 == ~id1~0; 669#L348 assume 0 == ~mode1~0 % 256; 670#L349 assume ~id2~0 >= 0; 712#L350 assume 0 == ~st2~0; 652#L351 assume ~send2~0 == ~id2~0; 653#L352 assume 0 == ~mode2~0 % 256; 702#L353 assume ~id3~0 >= 0; 621#L354 assume 0 == ~st3~0; 622#L355 assume ~send3~0 == ~id3~0; 674#L356 assume 0 == ~mode3~0 % 256; 675#L357 assume ~id4~0 >= 0; 733#L358 assume 0 == ~st4~0; 667#L359 assume ~send4~0 == ~id4~0; 668#L360 assume 0 == ~mode4~0 % 256; 709#L361 assume ~id5~0 >= 0; 649#L362 assume 0 == ~st5~0; 650#L363 assume ~send5~0 == ~id5~0; 701#L364 assume 0 == ~mode5~0 % 256; 619#L365 assume ~id6~0 >= 0; 620#L366 assume 0 == ~st6~0; 694#L367 assume ~send6~0 == ~id6~0; 695#L368 assume 0 == ~mode6~0 % 256; 732#L369 assume ~id7~0 >= 0; 665#L370 assume 0 == ~st7~0; 666#L371 assume ~send7~0 == ~id7~0; 706#L372 assume 0 == ~mode7~0 % 256; 647#L373 assume ~id8~0 >= 0; 648#L374 assume 0 == ~st8~0; 699#L375 assume ~send8~0 == ~id8~0; 615#L376 assume 0 == ~mode8~0 % 256; 616#L377 assume ~id1~0 != ~id2~0; 692#L378 assume ~id1~0 != ~id3~0; 693#L379 assume ~id1~0 != ~id4~0; 731#L380 assume ~id1~0 != ~id5~0; 663#L381 assume ~id1~0 != ~id6~0; 664#L382 assume ~id1~0 != ~id7~0; 725#L383 assume ~id1~0 != ~id8~0; 645#L384 assume ~id2~0 != ~id3~0; 646#L385 assume ~id2~0 != ~id4~0; 698#L386 assume ~id2~0 != ~id5~0; 613#L387 assume ~id2~0 != ~id6~0; 614#L388 assume ~id2~0 != ~id7~0; 690#L389 assume ~id2~0 != ~id8~0; 691#L390 assume ~id3~0 != ~id4~0; 730#L391 assume ~id3~0 != ~id5~0; 656#L392 assume ~id3~0 != ~id6~0; 657#L393 assume ~id3~0 != ~id7~0; 721#L394 assume ~id3~0 != ~id8~0; 641#L395 assume ~id4~0 != ~id5~0; 642#L396 assume ~id4~0 != ~id6~0; 696#L397 assume ~id4~0 != ~id7~0; 611#L398 assume ~id4~0 != ~id8~0; 612#L399 assume ~id5~0 != ~id6~0; 688#L400 assume ~id5~0 != ~id7~0; 689#L401 assume ~id5~0 != ~id8~0; 729#L402 assume ~id6~0 != ~id7~0; 654#L403 assume ~id6~0 != ~id8~0; 655#L404 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 739#L344-1 init_#res := init_~tmp~0; 738#L589 main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 719#L69 assume !(0 == assume_abort_if_not_~cond); 720#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 727#L679-2 [2020-10-26 05:56:13,748 INFO L796 eck$LassoCheckResult]: Loop: 727#L679-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 658#L139 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 659#L143 assume !(node1_~m1~0 != ~nomsg~0); 644#L143-1 ~mode1~0 := 0; 631#L139-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 632#L167 assume !(0 != ~mode2~0 % 256); 651#L180 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite8 := ~p2_new~0; 639#L180-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 640#L167-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 749#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 748#L195 assume !(node3_~m3~0 != ~nomsg~0); 683#L195-1 ~mode3~0 := 0; 662#L192-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 746#L217 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 740#L220 assume !(node4_~m4~0 != ~nomsg~0); 686#L220-1 ~mode4~0 := 0; 637#L217-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 741#L242 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 742#L245 assume !(node5_~m5~0 != ~nomsg~0); 673#L245-1 ~mode5~0 := 0; 724#L242-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 737#L267 assume !(0 != ~mode6~0 % 256); 744#L280 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite12 := ~send6~0; 751#L280-2 ~p6_new~0 := (if node6_#t~ite12 % 256 <= 127 then node6_#t~ite12 % 256 else node6_#t~ite12 % 256 - 256);havoc node6_#t~ite12;~mode6~0 := 1; 722#L267-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 723#L292 assume !(0 != ~mode7~0 % 256); 736#L305 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite13 := ~send7~0; 747#L305-2 ~p7_new~0 := (if node7_#t~ite13 % 256 <= 127 then node7_#t~ite13 % 256 else node7_#t~ite13 % 256 - 256);havoc node7_#t~ite13;~mode7~0 := 1; 697#L292-2 havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 713#L317 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 704#L320 assume !(node8_~m8~0 != ~nomsg~0); 626#L320-1 ~mode8~0 := 0; 705#L317-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 715#L597 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 703#L598 assume ~r1~0 >= 8; 677#L602 assume ~r1~0 < 8;check_~tmp~1 := 1; 711#L597-1 check_#res := check_~tmp~1; 707#L617 main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 708#L718 assume !(0 == assert_~arg % 256); 726#L713 main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 727#L679-2 [2020-10-26 05:56:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 2 times [2020-10-26 05:56:13,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:13,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643279693] [2020-10-26 05:56:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:13,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:13,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:13,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:56:13,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:13,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1651606983, now seen corresponding path program 1 times [2020-10-26 05:56:13,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:13,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721167120] [2020-10-26 05:56:13,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:56:14,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721167120] [2020-10-26 05:56:14,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:14,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:56:14,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644060017] [2020-10-26 05:56:14,051 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:56:14,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:56:14,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:56:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:56:14,052 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. cyclomatic complexity: 43 Second operand 3 states. [2020-10-26 05:56:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:56:14,118 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2020-10-26 05:56:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:56:14,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 288 transitions. [2020-10-26 05:56:14,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2020-10-26 05:56:14,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 288 transitions. [2020-10-26 05:56:14,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2020-10-26 05:56:14,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2020-10-26 05:56:14,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 288 transitions. [2020-10-26 05:56:14,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:56:14,137 INFO L691 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-10-26 05:56:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 288 transitions. [2020-10-26 05:56:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-26 05:56:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-26 05:56:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2020-10-26 05:56:14,163 INFO L714 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-10-26 05:56:14,164 INFO L594 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-10-26 05:56:14,164 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:56:14,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. [2020-10-26 05:56:14,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2020-10-26 05:56:14,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:14,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:14,171 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:14,172 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:14,172 INFO L794 eck$LassoCheckResult]: Stem: 1101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 989#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 990#L344 assume 0 == ~r1~0; 1032#L345 assume ~id1~0 >= 0; 1033#L346 assume 0 == ~st1~0; 1091#L347 assume ~send1~0 == ~id1~0; 1025#L348 assume 0 == ~mode1~0 % 256; 1026#L349 assume ~id2~0 >= 0; 1067#L350 assume 0 == ~st2~0; 1007#L351 assume ~send2~0 == ~id2~0; 1008#L352 assume 0 == ~mode2~0 % 256; 1058#L353 assume ~id3~0 >= 0; 977#L354 assume 0 == ~st3~0; 978#L355 assume ~send3~0 == ~id3~0; 1030#L356 assume 0 == ~mode3~0 % 256; 1031#L357 assume ~id4~0 >= 0; 1090#L358 assume 0 == ~st4~0; 1023#L359 assume ~send4~0 == ~id4~0; 1024#L360 assume 0 == ~mode4~0 % 256; 1064#L361 assume ~id5~0 >= 0; 1005#L362 assume 0 == ~st5~0; 1006#L363 assume ~send5~0 == ~id5~0; 1056#L364 assume 0 == ~mode5~0 % 256; 973#L365 assume ~id6~0 >= 0; 974#L366 assume 0 == ~st6~0; 1050#L367 assume ~send6~0 == ~id6~0; 1051#L368 assume 0 == ~mode6~0 % 256; 1089#L369 assume ~id7~0 >= 0; 1021#L370 assume 0 == ~st7~0; 1022#L371 assume ~send7~0 == ~id7~0; 1063#L372 assume 0 == ~mode7~0 % 256; 1003#L373 assume ~id8~0 >= 0; 1004#L374 assume 0 == ~st8~0; 1055#L375 assume ~send8~0 == ~id8~0; 971#L376 assume 0 == ~mode8~0 % 256; 972#L377 assume ~id1~0 != ~id2~0; 1048#L378 assume ~id1~0 != ~id3~0; 1049#L379 assume ~id1~0 != ~id4~0; 1088#L380 assume ~id1~0 != ~id5~0; 1019#L381 assume ~id1~0 != ~id6~0; 1020#L382 assume ~id1~0 != ~id7~0; 1081#L383 assume ~id1~0 != ~id8~0; 999#L384 assume ~id2~0 != ~id3~0; 1000#L385 assume ~id2~0 != ~id4~0; 1054#L386 assume ~id2~0 != ~id5~0; 969#L387 assume ~id2~0 != ~id6~0; 970#L388 assume ~id2~0 != ~id7~0; 1046#L389 assume ~id2~0 != ~id8~0; 1047#L390 assume ~id3~0 != ~id4~0; 1087#L391 assume ~id3~0 != ~id5~0; 1012#L392 assume ~id3~0 != ~id6~0; 1013#L393 assume ~id3~0 != ~id7~0; 1078#L394 assume ~id3~0 != ~id8~0; 997#L395 assume ~id4~0 != ~id5~0; 998#L396 assume ~id4~0 != ~id6~0; 1052#L397 assume ~id4~0 != ~id7~0; 967#L398 assume ~id4~0 != ~id8~0; 968#L399 assume ~id5~0 != ~id6~0; 1044#L400 assume ~id5~0 != ~id7~0; 1045#L401 assume ~id5~0 != ~id8~0; 1086#L402 assume ~id6~0 != ~id7~0; 1010#L403 assume ~id6~0 != ~id8~0; 1011#L404 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 1096#L344-1 init_#res := init_~tmp~0; 1095#L589 main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 1076#L69 assume !(0 == assume_abort_if_not_~cond); 1077#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 1084#L679-2 [2020-10-26 05:56:14,172 INFO L796 eck$LassoCheckResult]: Loop: 1084#L679-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1014#L139 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 1015#L143 assume !(node1_~m1~0 != ~nomsg~0); 1002#L143-1 ~mode1~0 := 0; 987#L139-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 988#L167 assume !(0 != ~mode2~0 % 256); 1009#L180 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite8 := ~p2_new~0; 995#L180-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 996#L167-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1108#L192 assume !(0 != ~mode3~0 % 256); 1027#L205 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite9 := ~p3_new~0; 1017#L205-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 1018#L192-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1104#L217 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1097#L220 assume !(node4_~m4~0 != ~nomsg~0); 1042#L220-1 ~mode4~0 := 0; 993#L217-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1098#L242 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1099#L245 assume !(node5_~m5~0 != ~nomsg~0); 1029#L245-1 ~mode5~0 := 0; 1082#L242-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1094#L267 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1092#L270 assume !(node6_~m6~0 != ~nomsg~0); 980#L270-1 ~mode6~0 := 0; 1079#L267-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 1080#L292 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1057#L295 assume !(node7_~m7~0 != ~nomsg~0); 985#L295-1 ~mode7~0 := 0; 1053#L292-2 havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 1070#L317 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 1061#L320 assume !(node8_~m8~0 != ~nomsg~0); 982#L320-1 ~mode8~0 := 0; 1062#L317-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1072#L597 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 1111#L598 assume !(~r1~0 >= 8); 1034#L601 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 1035#L602 assume ~r1~0 < 8;check_~tmp~1 := 1; 1100#L597-1 check_#res := check_~tmp~1; 1065#L617 main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1066#L718 assume !(0 == assert_~arg % 256); 1083#L713 main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 1084#L679-2 [2020-10-26 05:56:14,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 3 times [2020-10-26 05:56:14,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:14,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104802454] [2020-10-26 05:56:14,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:14,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:14,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:14,291 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:56:14,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash 902551047, now seen corresponding path program 1 times [2020-10-26 05:56:14,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:14,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948249788] [2020-10-26 05:56:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:14,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:14,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:14,364 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:56:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash 82038344, now seen corresponding path program 1 times [2020-10-26 05:56:14,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:14,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168960634] [2020-10-26 05:56:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:56:14,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168960634] [2020-10-26 05:56:14,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:14,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:56:14,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125348193] [2020-10-26 05:56:15,981 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 215 DAG size of output: 210 [2020-10-26 05:56:16,954 WARN L193 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 187 [2020-10-26 05:56:16,979 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:56:16,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:56:16,981 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:56:16,981 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:56:16,981 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 05:56:16,981 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:16,982 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:56:16,982 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:56:16,982 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.1.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2020-10-26 05:56:16,982 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:56:16,983 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:56:17,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,430 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2020-10-26 05:56:17,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:17,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:18,287 WARN L193 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-10-26 05:56:18,717 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-26 05:56:53,865 WARN L193 SmtUtils]: Spent 35.06 s on a formula simplification. DAG size of input: 288 DAG size of output: 178 [2020-10-26 05:56:54,290 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:56:54,291 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-26 05:56:54,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 05:56:54,309 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:56:54,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 05:56:54,357 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:54,552 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 05:56:54,556 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:56:54,556 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:56:54,556 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:56:54,557 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:56:54,557 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 05:56:54,557 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:54,557 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:56:54,557 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:56:54,558 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.1.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2020-10-26 05:56:54,558 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:56:54,558 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:56:54,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:54,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,005 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2020-10-26 05:56:55,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:55,830 WARN L193 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-10-26 05:56:56,320 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-26 05:57:32,222 WARN L193 SmtUtils]: Spent 35.85 s on a formula simplification. DAG size of input: 288 DAG size of output: 178 [2020-10-26 05:57:32,674 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:57:32,680 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-10-26 05:57:32,687 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 [2020-10-26 05:57:32,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:32,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:32,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:32,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:32,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:32,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:32,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:57:32,701 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) [2020-10-26 05:57:32,747 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:32,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:32,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:32,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:32,758 INFO L204 nArgumentSynthesizer]: 34 loop disjuncts [2020-10-26 05:57:32,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:33,387 INFO L401 nArgumentSynthesizer]: We have 68 Motzkin's Theorem applications. [2020-10-26 05:57:33,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:57:34,209 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) [2020-10-26 05:57:34,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 [2020-10-26 05:57:34,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:57:34,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:34,271 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) [2020-10-26 05:57:34,313 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 [2020-10-26 05:57:34,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:34,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:34,319 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:57:34,360 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 [2020-10-26 05:57:34,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:34,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:34,372 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) [2020-10-26 05:57:34,440 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 [2020-10-26 05:57:34,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:34,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:57:34,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 9 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 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:34,493 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 [2020-10-26 05:57:34,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,495 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 05:57:34,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,499 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-26 05:57:34,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:57:34,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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:57:34,549 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 [2020-10-26 05:57:34,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:34,552 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 [2020-10-26 05:57:34,555 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) [2020-10-26 05:57:34,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 [2020-10-26 05:57:34,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:34,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:34,598 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) [2020-10-26 05:57:34,637 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 [2020-10-26 05:57:34,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:57:34,642 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 [2020-10-26 05:57:34,647 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) [2020-10-26 05:57:34,688 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 [2020-10-26 05:57:34,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:34,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:34,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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:57:34,750 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 [2020-10-26 05:57:34,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:57:34,756 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 [2020-10-26 05:57:34,762 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:57:34,809 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 [2020-10-26 05:57:34,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:57:34,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:57:34,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 16 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:57:34,860 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 [2020-10-26 05:57:34,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:34,864 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 [2020-10-26 05:57:34,866 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) [2020-10-26 05:57:34,907 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 [2020-10-26 05:57:34,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:34,910 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 [2020-10-26 05:57:34,912 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) [2020-10-26 05:57:34,952 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 [2020-10-26 05:57:34,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:34,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:34,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:34,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:34,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:34,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:34,957 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 [2020-10-26 05:57:34,961 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) [2020-10-26 05:57:35,004 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 [2020-10-26 05:57:35,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:35,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:35,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:35,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:35,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:57:35,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:35,020 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) [2020-10-26 05:57:35,062 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 [2020-10-26 05:57:35,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:35,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:35,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:35,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:35,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:57:35,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:35,070 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) [2020-10-26 05:57:35,107 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 [2020-10-26 05:57:35,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:35,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:35,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:35,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:35,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:35,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:35,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:35,111 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) [2020-10-26 05:57:35,146 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 [2020-10-26 05:57:35,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:35,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:35,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:35,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:35,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:57:35,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:35,154 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:35,183 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 [2020-10-26 05:57:35,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:35,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:35,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:35,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:35,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:35,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:35,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:57:35,190 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:35,217 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 [2020-10-26 05:57:35,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:57:35,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:57:35,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:57:35,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:57:35,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:57:35,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:57:35,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:57:35,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 05:57:35,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 05:57:35,236 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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) [2020-10-26 05:57:35,243 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 05:57:35,243 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 05:57:35,244 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 05:57:35,244 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 31 Supporting invariants [] Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:57:35,287 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 05:57:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:57:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:57:35,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 05:57:35,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:57:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:57:35,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 05:57:35,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:57:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:57:35,633 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 05:57:35,634 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80 Second operand 3 states. [2020-10-26 05:57:35,701 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80. Second operand 3 states. Result 350 states and 509 transitions. Complement of second has 4 states. [2020-10-26 05:57:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-26 05:57:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 05:57:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-10-26 05:57:35,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 67 letters. Loop has 41 letters. [2020-10-26 05:57:35,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:57:35,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 108 letters. Loop has 41 letters. [2020-10-26 05:57:35,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:57:35,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 67 letters. Loop has 82 letters. [2020-10-26 05:57:35,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:57:35,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 509 transitions. [2020-10-26 05:57:35,715 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:57:35,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 0 states and 0 transitions. [2020-10-26 05:57:35,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:57:35,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:57:35,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:57:35,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:57:35,716 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:57:35,716 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:57:35,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:57:35,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:57:35,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:57:35,717 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-10-26 05:57:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:57:35,717 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-26 05:57:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 05:57:35,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-26 05:57:35,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:57:35,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 05:57:35,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:57:35,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:57:35,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:57:35,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:57:35,719 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:57:35,719 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:57:35,719 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:57:35,719 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:57:35,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 05:57:35,719 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:57:35,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 05:57:35,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:57:35 BoogieIcfgContainer [2020-10-26 05:57:35,726 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:57:35,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:57:35,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:57:35,727 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:57:35,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:56:11" (3/4) ... [2020-10-26 05:57:35,731 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 05:57:35,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:57:35,734 INFO L168 Benchmark]: Toolchain (without parser) took 85757.90 ms. Allocated memory was 48.2 MB in the beginning and 182.5 MB in the end (delta: 134.2 MB). Free memory was 31.5 MB in the beginning and 67.8 MB in the end (delta: -36.3 MB). Peak memory consumption was 99.2 MB. Max. memory is 16.1 GB. [2020-10-26 05:57:35,734 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:57:35,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.84 ms. Allocated memory is still 48.2 MB. Free memory was 30.8 MB in the beginning and 23.3 MB in the end (delta: 7.5 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. [2020-10-26 05:57:35,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.35 ms. Allocated memory is still 48.2 MB. Free memory was 23.3 MB in the beginning and 30.0 MB in the end (delta: -6.7 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. [2020-10-26 05:57:35,737 INFO L168 Benchmark]: Boogie Preprocessor took 109.32 ms. Allocated memory is still 48.2 MB. Free memory was 30.0 MB in the beginning and 27.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:57:35,737 INFO L168 Benchmark]: RCFGBuilder took 1171.85 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 27.3 MB in the beginning and 33.0 MB in the end (delta: -5.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2020-10-26 05:57:35,738 INFO L168 Benchmark]: BuchiAutomizer took 83798.36 ms. Allocated memory was 58.7 MB in the beginning and 182.5 MB in the end (delta: 123.7 MB). Free memory was 32.7 MB in the beginning and 68.9 MB in the end (delta: -36.2 MB). Peak memory consumption was 86.5 MB. Max. memory is 16.1 GB. [2020-10-26 05:57:35,739 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 182.5 MB. Free memory was 68.9 MB in the beginning and 67.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:57:35,743 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 568.84 ms. Allocated memory is still 48.2 MB. Free memory was 30.8 MB in the beginning and 23.3 MB in the end (delta: 7.5 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.35 ms. Allocated memory is still 48.2 MB. Free memory was 23.3 MB in the beginning and 30.0 MB in the end (delta: -6.7 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 109.32 ms. Allocated memory is still 48.2 MB. Free memory was 30.0 MB in the beginning and 27.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1171.85 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 27.3 MB in the beginning and 33.0 MB in the end (delta: -5.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 83798.36 ms. Allocated memory was 58.7 MB in the beginning and 182.5 MB in the end (delta: 123.7 MB). Free memory was 32.7 MB in the beginning and 68.9 MB in the end (delta: -36.2 MB). Peak memory consumption was 86.5 MB. Max. memory is 16.1 GB. * Witness Printer took 4.91 ms. Allocated memory is still 182.5 MB. Free memory was 68.9 MB in the beginning and 67.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 31 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 83.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 82.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 209 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 895 SDtfs, 290 SDslu, 1519 SDs, 0 SdLazy, 36 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital288 mio100 ax133 hnf107 lsp48 ukn75 mio100 lsp100 div141 bol100 ite100 ukn100 eq184 hnf75 smp100 dnf11772 smp23 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 1470ms VariablesStem: 0 VariablesLoop: 45 DisjunctsStem: 1 DisjunctsLoop: 34 SupportingInvariants: 0 MotzkinApplications: 68 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...