./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.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.4.1.ufo.BOUNDED-8.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 b8cf45c0e14794b09cd054558980122aaa1f6b82 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54:06,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:54:06,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:54:06,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:54:06,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:54:06,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:54:06,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:54:06,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:54:06,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:54:06,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:54:06,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:54:06,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:54:06,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:54:06,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:54:06,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:54:06,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:54:06,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:54:06,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:54:06,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:54:06,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:54:06,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:54:06,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:54:06,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:54:06,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:54:06,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:54:06,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:54:06,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:54:06,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:54:06,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:54:06,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:54:06,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:54:06,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:54:06,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:54:06,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:54:06,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:54:06,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:54:06,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:54:06,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:54:06,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:54:06,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:54:06,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:54:06,608 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:54:06,659 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:54:06,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:54:06,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:54:06,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:54:06,663 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:54:06,664 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:54:06,664 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:54:06,664 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:54:06,664 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:54:06,665 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:54:06,666 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:54:06,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:54:06,666 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:54:06,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:54:06,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:54:06,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:54:06,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:54:06,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:54:06,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:54:06,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:54:06,668 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:54:06,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:54:06,669 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:54:06,669 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:54:06,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:54:06,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:54:06,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:54:06,670 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:54:06,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:54:06,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:54:06,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:54:06,671 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:54:06,673 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:54:06,673 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 -> b8cf45c0e14794b09cd054558980122aaa1f6b82 [2020-10-26 05:54:07,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:54:07,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:54:07,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:54:07,138 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:54:07,139 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:54:07,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2020-10-26 05:54:07,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07938506/126075c6174a4d2394763c2ebcf3f7e8/FLAG32f9cb17e [2020-10-26 05:54:07,828 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:54:07,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2020-10-26 05:54:07,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07938506/126075c6174a4d2394763c2ebcf3f7e8/FLAG32f9cb17e [2020-10-26 05:54:08,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07938506/126075c6174a4d2394763c2ebcf3f7e8 [2020-10-26 05:54:08,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:54:08,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:54:08,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:54:08,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:54:08,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:54:08,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:54:08" (1/1) ... [2020-10-26 05:54:08,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5822a981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08, skipping insertion in model container [2020-10-26 05:54:08,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:54:08" (1/1) ... [2020-10-26 05:54:08,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:54:08,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:54:08,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:54:08,626 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:54:08,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:54:08,719 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:54:08,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08 WrapperNode [2020-10-26 05:54:08,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:54:08,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:54:08,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:54:08,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:54:08,731 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:54:08" (1/1) ... [2020-10-26 05:54:08,749 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:54:08" (1/1) ... [2020-10-26 05:54:08,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:54:08,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:54:08,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:54:08,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:54:08,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08" (1/1) ... [2020-10-26 05:54:08,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08" (1/1) ... [2020-10-26 05:54:08,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08" (1/1) ... [2020-10-26 05:54:08,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08" (1/1) ... [2020-10-26 05:54:08,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08" (1/1) ... [2020-10-26 05:54:08,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08" (1/1) ... [2020-10-26 05:54:08,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08" (1/1) ... [2020-10-26 05:54:08,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:54:08,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:54:08,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:54:08,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:54:08,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08" (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:54:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:54:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:54:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:54:08,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:54:09,633 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:54:09,633 INFO L298 CfgBuilder]: Removed 21 assume(true) statements. [2020-10-26 05:54:09,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:54:09 BoogieIcfgContainer [2020-10-26 05:54:09,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:54:09,637 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:54:09,637 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:54:09,640 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:54:09,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:54:09,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:54:08" (1/3) ... [2020-10-26 05:54:09,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d2b82fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:54:09, skipping insertion in model container [2020-10-26 05:54:09,643 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:54:09,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:08" (2/3) ... [2020-10-26 05:54:09,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d2b82fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:54:09, skipping insertion in model container [2020-10-26 05:54:09,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:54:09,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:54:09" (3/3) ... [2020-10-26 05:54:09,645 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2020-10-26 05:54:09,712 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:54:09,713 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:54:09,713 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:54:09,713 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:54:09,713 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:54:09,713 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:54:09,714 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:54:09,714 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:54:09,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2020-10-26 05:54:09,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-10-26 05:54:09,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:09,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:09,789 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:09,789 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] [2020-10-26 05:54:09,790 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:54:09,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2020-10-26 05:54:09,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-10-26 05:54:09,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:09,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:09,800 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:09,800 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] [2020-10-26 05:54:09,809 INFO L794 eck$LassoCheckResult]: Stem: 34#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(34);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;~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]; 14#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 67#L211true assume !(0 == ~r1~0);init_~tmp~0 := 0; 65#L211-1true init_#res := init_~tmp~0; 39#L304true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 52#L360true assume !(0 == main_~i2~0); 55#L360-2true ~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;main_~i2~0 := 0; 40#L370-2true [2020-10-26 05:54:09,810 INFO L796 eck$LassoCheckResult]: Loop: 40#L370-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 76#L108true assume !(0 != ~mode1~0 % 256); 8#L124true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 3#L124-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; 72#L108-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 30#L136true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 35#L139true assume !(node2_~m2~0 != ~nomsg~0); 33#L139-1true ~mode2~0 := 0; 27#L136-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 37#L161true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 24#L164true assume !(node3_~m3~0 != ~nomsg~0); 22#L164-1true ~mode3~0 := 0; 32#L161-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 4#L186true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 66#L189true assume !(node4_~m4~0 != ~nomsg~0); 64#L189-1true ~mode4~0 := 0; 20#L186-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 45#L312true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 46#L312-1true check_#res := check_~tmp~1; 9#L332true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 63#L397true assume !(0 == assert_~arg % 256); 36#L392true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 40#L370-2true [2020-10-26 05:54:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:09,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2020-10-26 05:54:09,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:09,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035541321] [2020-10-26 05:54:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:10,087 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:54:10,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035541321] [2020-10-26 05:54:10,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:10,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:54:10,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190967488] [2020-10-26 05:54:10,095 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:54:10,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1511728235, now seen corresponding path program 1 times [2020-10-26 05:54:10,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:10,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485785342] [2020-10-26 05:54:10,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:10,281 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:54:10,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485785342] [2020-10-26 05:54:10,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:10,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:54:10,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745770698] [2020-10-26 05:54:10,284 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:54:10,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:54:10,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:54:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:54:10,307 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 5 states. [2020-10-26 05:54:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:54:10,537 INFO L93 Difference]: Finished difference Result 122 states and 194 transitions. [2020-10-26 05:54:10,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 05:54:10,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 194 transitions. [2020-10-26 05:54:10,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-10-26 05:54:10,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 113 states and 163 transitions. [2020-10-26 05:54:10,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2020-10-26 05:54:10,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2020-10-26 05:54:10,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 163 transitions. [2020-10-26 05:54:10,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:54:10,575 INFO L691 BuchiCegarLoop]: Abstraction has 113 states and 163 transitions. [2020-10-26 05:54:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 163 transitions. [2020-10-26 05:54:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2020-10-26 05:54:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-26 05:54:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2020-10-26 05:54:10,608 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2020-10-26 05:54:10,608 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2020-10-26 05:54:10,608 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:54:10,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2020-10-26 05:54:10,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-10-26 05:54:10,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:10,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:10,612 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] [2020-10-26 05:54:10,612 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] [2020-10-26 05:54:10,613 INFO L794 eck$LassoCheckResult]: Stem: 264#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(34);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;~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]; 241#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 242#L211 assume 0 == ~r1~0; 239#L212 assume ~id1~0 >= 0; 240#L213 assume 0 == ~st1~0; 278#L214 assume ~send1~0 == ~id1~0; 245#L215 assume 0 == ~mode1~0 % 256; 246#L216 assume ~id2~0 >= 0; 269#L217 assume 0 == ~st2~0; 283#L218 assume ~send2~0 == ~id2~0; 222#L219 assume 0 == ~mode2~0 % 256; 223#L220 assume ~id3~0 >= 0; 258#L221 assume 0 == ~st3~0; 276#L222 assume ~send3~0 == ~id3~0; 262#L223 assume 0 == ~mode3~0 % 256; 263#L224 assume ~id4~0 >= 0; 279#L225 assume 0 == ~st4~0; 247#L226 assume ~send4~0 == ~id4~0; 248#L227 assume 0 == ~mode4~0 % 256; 270#L228 assume ~id1~0 != ~id2~0; 284#L229 assume ~id1~0 != ~id3~0; 224#L230 assume ~id1~0 != ~id4~0; 225#L231 assume ~id2~0 != ~id3~0; 259#L232 assume ~id2~0 != ~id4~0; 277#L233 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 286#L211-1 init_#res := init_~tmp~0; 271#L304 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 272#L360 assume !(0 == main_~i2~0); 280#L360-2 ~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;main_~i2~0 := 0; 267#L370-2 [2020-10-26 05:54:10,613 INFO L796 eck$LassoCheckResult]: Loop: 267#L370-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 273#L108 assume !(0 != ~mode1~0 % 256); 229#L124 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 217#L124-2 ~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; 218#L108-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 260#L136 assume !(0 != ~mode2~0 % 256); 243#L149 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 244#L149-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; 256#L136-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 257#L161 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 252#L164 assume !(node3_~m3~0 != ~nomsg~0); 235#L164-1 ~mode3~0 := 0; 251#L161-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 219#L186 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 220#L189 assume !(node4_~m4~0 != ~nomsg~0); 237#L189-1 ~mode4~0 := 0; 249#L186-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 250#L312 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 233#L312-1 check_#res := check_~tmp~1; 230#L332 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 231#L397 assume !(0 == assert_~arg % 256); 266#L392 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 267#L370-2 [2020-10-26 05:54:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2020-10-26 05:54:10,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:10,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481776654] [2020-10-26 05:54:10,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:10,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:10,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:10,741 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:54:10,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:10,742 INFO L82 PathProgramCache]: Analyzing trace with hash -82556447, now seen corresponding path program 1 times [2020-10-26 05:54:10,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:10,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594164974] [2020-10-26 05:54:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:10,892 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:54:10,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594164974] [2020-10-26 05:54:10,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:10,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:54:10,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601654650] [2020-10-26 05:54:10,893 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:54:10,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:54:10,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:54:10,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:54:10,896 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. cyclomatic complexity: 26 Second operand 5 states. [2020-10-26 05:54:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:54:10,980 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2020-10-26 05:54:10,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:54:10,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2020-10-26 05:54:10,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-10-26 05:54:10,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2020-10-26 05:54:10,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2020-10-26 05:54:10,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-10-26 05:54:10,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2020-10-26 05:54:10,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:54:10,987 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-10-26 05:54:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2020-10-26 05:54:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-26 05:54:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-26 05:54:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2020-10-26 05:54:10,993 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-10-26 05:54:10,993 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-10-26 05:54:10,993 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:54:10,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2020-10-26 05:54:10,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-10-26 05:54:10,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:10,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:10,996 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] [2020-10-26 05:54:10,996 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] [2020-10-26 05:54:10,997 INFO L794 eck$LassoCheckResult]: Stem: 421#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(34);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;~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]; 398#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 399#L211 assume 0 == ~r1~0; 396#L212 assume ~id1~0 >= 0; 397#L213 assume 0 == ~st1~0; 435#L214 assume ~send1~0 == ~id1~0; 402#L215 assume 0 == ~mode1~0 % 256; 403#L216 assume ~id2~0 >= 0; 426#L217 assume 0 == ~st2~0; 440#L218 assume ~send2~0 == ~id2~0; 379#L219 assume 0 == ~mode2~0 % 256; 380#L220 assume ~id3~0 >= 0; 415#L221 assume 0 == ~st3~0; 433#L222 assume ~send3~0 == ~id3~0; 419#L223 assume 0 == ~mode3~0 % 256; 420#L224 assume ~id4~0 >= 0; 436#L225 assume 0 == ~st4~0; 404#L226 assume ~send4~0 == ~id4~0; 405#L227 assume 0 == ~mode4~0 % 256; 427#L228 assume ~id1~0 != ~id2~0; 441#L229 assume ~id1~0 != ~id3~0; 381#L230 assume ~id1~0 != ~id4~0; 382#L231 assume ~id2~0 != ~id3~0; 416#L232 assume ~id2~0 != ~id4~0; 434#L233 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 443#L211-1 init_#res := init_~tmp~0; 428#L304 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 429#L360 assume !(0 == main_~i2~0); 437#L360-2 ~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;main_~i2~0 := 0; 424#L370-2 [2020-10-26 05:54:10,997 INFO L796 eck$LassoCheckResult]: Loop: 424#L370-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 430#L108 assume !(0 != ~mode1~0 % 256); 386#L124 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 374#L124-2 ~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; 375#L108-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 417#L136 assume !(0 != ~mode2~0 % 256); 400#L149 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 401#L149-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; 413#L136-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 414#L161 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 409#L164 assume !(node3_~m3~0 != ~nomsg~0); 392#L164-1 ~mode3~0 := 0; 408#L161-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 376#L186 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 377#L189 assume !(node4_~m4~0 != ~nomsg~0); 394#L189-1 ~mode4~0 := 0; 406#L186-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 407#L312 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 432#L313 assume ~r1~0 >= 4; 439#L317 assume ~r1~0 < 4;check_~tmp~1 := 1; 390#L312-1 check_#res := check_~tmp~1; 387#L332 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 388#L397 assume !(0 == assert_~arg % 256); 423#L392 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 424#L370-2 [2020-10-26 05:54:10,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:10,998 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2020-10-26 05:54:10,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:10,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605240660] [2020-10-26 05:54:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:11,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:11,085 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:11,111 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:54:11,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash 851750385, now seen corresponding path program 1 times [2020-10-26 05:54:11,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:11,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544850561] [2020-10-26 05:54:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:11,166 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:54:11,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544850561] [2020-10-26 05:54:11,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:11,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:54:11,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754023588] [2020-10-26 05:54:11,168 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:54:11,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:54:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:54:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:54:11,170 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-10-26 05:54:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:54:11,213 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2020-10-26 05:54:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:54:11,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2020-10-26 05:54:11,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-10-26 05:54:11,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2020-10-26 05:54:11,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2020-10-26 05:54:11,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2020-10-26 05:54:11,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2020-10-26 05:54:11,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:54:11,220 INFO L691 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2020-10-26 05:54:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2020-10-26 05:54:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-26 05:54:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-26 05:54:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2020-10-26 05:54:11,229 INFO L714 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2020-10-26 05:54:11,229 INFO L594 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2020-10-26 05:54:11,229 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:54:11,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2020-10-26 05:54:11,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-10-26 05:54:11,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:11,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:11,232 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] [2020-10-26 05:54:11,232 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] [2020-10-26 05:54:11,233 INFO L794 eck$LassoCheckResult]: Stem: 608#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(34);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;~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]; 582#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 583#L211 assume 0 == ~r1~0; 580#L212 assume ~id1~0 >= 0; 581#L213 assume 0 == ~st1~0; 625#L214 assume ~send1~0 == ~id1~0; 586#L215 assume 0 == ~mode1~0 % 256; 587#L216 assume ~id2~0 >= 0; 615#L217 assume 0 == ~st2~0; 630#L218 assume ~send2~0 == ~id2~0; 563#L219 assume 0 == ~mode2~0 % 256; 564#L220 assume ~id3~0 >= 0; 600#L221 assume 0 == ~st3~0; 623#L222 assume ~send3~0 == ~id3~0; 604#L223 assume 0 == ~mode3~0 % 256; 605#L224 assume ~id4~0 >= 0; 626#L225 assume 0 == ~st4~0; 588#L226 assume ~send4~0 == ~id4~0; 589#L227 assume 0 == ~mode4~0 % 256; 617#L228 assume ~id1~0 != ~id2~0; 631#L229 assume ~id1~0 != ~id3~0; 565#L230 assume ~id1~0 != ~id4~0; 566#L231 assume ~id2~0 != ~id3~0; 601#L232 assume ~id2~0 != ~id4~0; 624#L233 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 634#L211-1 init_#res := init_~tmp~0; 618#L304 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 619#L360 assume !(0 == main_~i2~0); 627#L360-2 ~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;main_~i2~0 := 0; 610#L370-2 [2020-10-26 05:54:11,233 INFO L796 eck$LassoCheckResult]: Loop: 610#L370-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 616#L108 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 633#L112 assume !(node1_~m1~0 != ~nomsg~0); 568#L112-1 ~mode1~0 := 0; 559#L108-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 602#L136 assume !(0 != ~mode2~0 % 256); 584#L149 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 585#L149-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; 607#L136-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 649#L161 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 594#L164 assume !(node3_~m3~0 != ~nomsg~0); 576#L164-1 ~mode3~0 := 0; 646#L161-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 645#L186 assume !(0 != ~mode4~0 % 256); 641#L199 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 639#L199-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; 638#L186-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 637#L312 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 636#L313 assume !(~r1~0 >= 4); 628#L316 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 629#L317 assume ~r1~0 < 4;check_~tmp~1 := 1; 622#L312-1 check_#res := check_~tmp~1; 571#L332 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 572#L397 assume !(0 == assert_~arg % 256); 609#L392 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 610#L370-2 [2020-10-26 05:54:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2020-10-26 05:54:11,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:11,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667124801] [2020-10-26 05:54:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:11,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:11,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:11,285 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:54:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1484691759, now seen corresponding path program 1 times [2020-10-26 05:54:11,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:11,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575600145] [2020-10-26 05:54:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:11,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:11,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:11,332 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:54:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:11,345 INFO L82 PathProgramCache]: Analyzing trace with hash 526581641, now seen corresponding path program 1 times [2020-10-26 05:54:11,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:11,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150784983] [2020-10-26 05:54:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:11,444 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:54:11,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150784983] [2020-10-26 05:54:11,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:11,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:54:11,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085675345] [2020-10-26 05:54:12,075 WARN L193 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2020-10-26 05:54:12,645 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 121 [2020-10-26 05:54:12,659 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:54:12,660 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:54:12,660 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:54:12,661 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:54:12,661 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 05:54:12,661 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:54:12,661 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:54:12,661 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:54:12,662 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2020-10-26 05:54:12,662 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:54:12,662 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:54:12,688 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:54:12,700 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:54:12,704 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:54:12,711 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:54:12,718 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:54:12,722 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:54:12,726 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:54:12,729 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:54:12,739 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:54:12,742 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:54:12,761 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:54:12,775 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:54:12,779 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:54:12,783 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:54:12,787 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:54:12,793 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:54:12,798 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:54:12,805 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:54:12,809 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:54:12,812 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:54:12,816 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:54:12,819 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:54:12,823 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:54:13,031 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-26 05:54:13,033 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:54:13,569 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-26 05:54:13,584 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-26 05:54:20,753 WARN L193 SmtUtils]: Spent 6.91 s on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2020-10-26 05:54:20,810 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:54:20,811 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:54:20,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 05:54:20,821 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:54:20,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 05:54:20,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 05:54:20,896 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 05:54:20,899 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:54:20,899 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:54:20,899 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:54:20,899 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:54:20,899 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 05:54:20,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:54:20,900 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:54:20,900 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:54:20,900 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2020-10-26 05:54:20,900 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:54:20,900 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:54:20,905 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:54:20,913 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:54:20,921 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:54:20,928 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:54:20,932 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:54:20,935 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:54:20,938 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:54:20,941 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:54:20,944 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:54:20,963 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:54:20,966 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:54:20,970 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:54:20,977 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:54:20,984 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:54:20,988 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:54:20,991 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:54:21,214 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-26 05:54:21,217 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:54:21,224 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:54:21,228 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:54:21,237 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:54:21,247 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:54:21,250 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:54:21,253 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:54:21,256 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:54:21,685 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-26 05:54:21,781 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-26 05:54:28,702 WARN L193 SmtUtils]: Spent 6.73 s on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2020-10-26 05:54:28,800 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:54:28,811 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) [2020-10-26 05:54:28,828 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:54:28,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:54:28,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:54:28,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:54:28,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:54:28,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:54:28,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:54:28,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:54:28,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 05:54:28,846 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 05:54:28,846 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:54:28,852 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 05:54:28,853 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 05:54:28,853 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 05:54:28,854 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:54:28,886 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 05:54:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:28,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 05:54:28,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:54:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:29,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 05:54:29,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:54:29,119 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:54:29,125 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:54:29,128 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40 Second operand 3 states. [2020-10-26 05:54:29,222 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40. Second operand 3 states. Result 184 states and 263 transitions. Complement of second has 4 states. [2020-10-26 05:54:29,224 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:54:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 05:54:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-10-26 05:54:29,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 25 letters. [2020-10-26 05:54:29,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:54:29,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 54 letters. Loop has 25 letters. [2020-10-26 05:54:29,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:54:29,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 50 letters. [2020-10-26 05:54:29,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:54:29,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 263 transitions. [2020-10-26 05:54:29,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:54:29,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. [2020-10-26 05:54:29,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:54:29,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:54:29,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:54:29,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:54:29,233 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:54:29,233 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:54:29,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:54:29,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:54:29,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:54:29,235 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-10-26 05:54:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:54:29,235 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-26 05:54:29,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 05:54:29,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-26 05:54:29,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:54:29,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 05:54:29,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:54:29,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:54:29,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:54:29,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:54:29,237 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:54:29,237 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:54:29,237 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:54:29,237 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:54:29,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 05:54:29,238 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:54:29,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 05:54:29,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:54:29 BoogieIcfgContainer [2020-10-26 05:54:29,244 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:54:29,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:54:29,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:54:29,245 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:54:29,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:54:09" (3/4) ... [2020-10-26 05:54:29,248 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 05:54:29,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:54:29,250 INFO L168 Benchmark]: Toolchain (without parser) took 21066.53 ms. Allocated memory was 48.2 MB in the beginning and 104.9 MB in the end (delta: 56.6 MB). Free memory was 25.0 MB in the beginning and 29.0 MB in the end (delta: -3.9 MB). Peak memory consumption was 55.6 MB. Max. memory is 16.1 GB. [2020-10-26 05:54:29,251 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 48.2 MB. Free memory is still 30.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:54:29,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.31 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 24.4 MB in the end (delta: 71.3 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-10-26 05:54:29,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.35 ms. Allocated memory is still 48.2 MB. Free memory was 24.4 MB in the beginning and 22.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:54:29,253 INFO L168 Benchmark]: Boogie Preprocessor took 74.40 ms. Allocated memory is still 48.2 MB. Free memory was 22.2 MB in the beginning and 20.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:54:29,254 INFO L168 Benchmark]: RCFGBuilder took 749.88 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 20.3 MB in the beginning and 38.7 MB in the end (delta: -18.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2020-10-26 05:54:29,255 INFO L168 Benchmark]: BuchiAutomizer took 19607.10 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 38.7 MB in the beginning and 30.1 MB in the end (delta: 8.7 MB). Peak memory consumption was 53.0 MB. Max. memory is 16.1 GB. [2020-10-26 05:54:29,256 INFO L168 Benchmark]: Witness Printer took 4.60 ms. Allocated memory is still 104.9 MB. Free memory was 30.1 MB in the beginning and 29.0 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:54:29,261 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.26 ms. Allocated memory is still 48.2 MB. Free memory is still 30.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 528.31 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 24.4 MB in the end (delta: 71.3 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.35 ms. Allocated memory is still 48.2 MB. Free memory was 24.4 MB in the beginning and 22.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.40 ms. Allocated memory is still 48.2 MB. Free memory was 22.2 MB in the beginning and 20.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 749.88 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 20.3 MB in the beginning and 38.7 MB in the end (delta: -18.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 19607.10 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 38.7 MB in the beginning and 30.1 MB in the end (delta: 8.7 MB). Peak memory consumption was 53.0 MB. Max. memory is 16.1 GB. * Witness Printer took 4.60 ms. Allocated memory is still 104.9 MB. Free memory was 30.1 MB in the beginning and 29.0 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 + 15 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 19.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 18.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 42 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 107 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 443 SDtfs, 215 SDslu, 752 SDs, 0 SdLazy, 46 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax124 hnf104 lsp57 ukn67 mio100 lsp100 div162 bol100 ite100 ukn100 eq171 hnf69 smp100 dnf5114 smp24 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...