./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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 8044e0aeebe72762497fc5ccaff76a34eb4c9821 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:21:27,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:21:27,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:21:27,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:21:27,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:21:27,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:21:27,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:21:27,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:21:27,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:21:27,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:21:27,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:21:27,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:21:27,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:21:27,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:21:27,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:21:27,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:21:27,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:21:27,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:21:27,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:21:27,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:21:27,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:21:27,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:21:27,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:21:27,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:21:27,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:21:27,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:21:27,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:21:27,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:21:27,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:21:27,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:21:27,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:21:27,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:21:27,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:21:27,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:21:27,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:21:27,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:21:27,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:21:27,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:21:27,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:21:27,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:21:27,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:21:27,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:21:27,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:21:27,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:21:27,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:21:27,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:21:27,239 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:21:27,240 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:21:27,240 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:21:27,240 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:21:27,240 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:21:27,241 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:21:27,242 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:21:27,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:21:27,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:21:27,243 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:21:27,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:21:27,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:21:27,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:21:27,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:21:27,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:21:27,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:21:27,246 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:21:27,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:21:27,247 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:21:27,247 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:21:27,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:21:27,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:21:27,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:21:27,248 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:21:27,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:21:27,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:21:27,249 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:21:27,249 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:21:27,252 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:21:27,252 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8044e0aeebe72762497fc5ccaff76a34eb4c9821 [2019-11-28 21:21:27,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:21:27,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:21:27,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:21:27,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:21:27,612 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:21:27,613 INFO L428 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 [2019-11-28 21:21:27,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07d7547e/331a5af2537e4115931f4f4249dba520/FLAG9805836a4 [2019-11-28 21:21:28,177 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:21:28,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2019-11-28 21:21:28,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07d7547e/331a5af2537e4115931f4f4249dba520/FLAG9805836a4 [2019-11-28 21:21:28,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07d7547e/331a5af2537e4115931f4f4249dba520 [2019-11-28 21:21:28,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:21:28,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:21:28,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:21:28,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:21:28,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:21:28,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:21:28" (1/1) ... [2019-11-28 21:21:28,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564c4a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:28, skipping insertion in model container [2019-11-28 21:21:28,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:21:28" (1/1) ... [2019-11-28 21:21:28,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:21:28,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:21:28,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:21:28,883 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:21:28,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:21:29,017 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:21:29,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29 WrapperNode [2019-11-28 21:21:29,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:21:29,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:21:29,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:21:29,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:21:29,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... [2019-11-28 21:21:29,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... [2019-11-28 21:21:29,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:21:29,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:21:29,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:21:29,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:21:29,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... [2019-11-28 21:21:29,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... [2019-11-28 21:21:29,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... [2019-11-28 21:21:29,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... [2019-11-28 21:21:29,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... [2019-11-28 21:21:29,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... [2019-11-28 21:21:29,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... [2019-11-28 21:21:29,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:21:29,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:21:29,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:21:29,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:21:29,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:29,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:21:29,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:21:29,766 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:21:29,766 INFO L287 CfgBuilder]: Removed 19 assume(true) statements. [2019-11-28 21:21:29,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:21:29 BoogieIcfgContainer [2019-11-28 21:21:29,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:21:29,769 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:21:29,769 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:21:29,773 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:21:29,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:21:29,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:21:28" (1/3) ... [2019-11-28 21:21:29,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bd0ed81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:21:29, skipping insertion in model container [2019-11-28 21:21:29,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:21:29,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:29" (2/3) ... [2019-11-28 21:21:29,777 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bd0ed81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:21:29, skipping insertion in model container [2019-11-28 21:21:29,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:21:29,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:21:29" (3/3) ... [2019-11-28 21:21:29,781 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2019-11-28 21:21:29,838 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:21:29,838 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:21:29,840 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:21:29,840 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:21:29,841 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:21:29,841 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:21:29,841 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:21:29,841 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:21:29,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-11-28 21:21:29,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2019-11-28 21:21:29,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:29,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:29,903 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:21:29,903 INFO L850 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] [2019-11-28 21:21:29,903 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:21:29,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-11-28 21:21:29,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2019-11-28 21:21:29,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:29,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:29,911 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:21:29,911 INFO L850 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] [2019-11-28 21:21:29,919 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~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]; 10#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 22#L209true assume !(0 == ~r1~0);init_~tmp~0 := 0; 20#L209-1true init_#res := init_~tmp~0; 75#L302true main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~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; 62#L368-2true [2019-11-28 21:21:29,920 INFO L796 eck$LassoCheckResult]: Loop: 62#L368-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 31#L106true 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; 39#L110true assume !(node1_~m1~0 != ~nomsg~0); 35#L110-1true ~mode1~0 := 0; 7#L106-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 65#L134true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 48#L137true assume !(node2_~m2~0 != ~nomsg~0); 47#L137-1true ~mode2~0 := 0; 76#L134-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 69#L159true assume !(0 != ~mode3~0 % 256); 34#L172true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 32#L172-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 46#L159-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 58#L184true assume !(0 != ~mode4~0 % 256); 3#L197true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 16#L197-2true ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 54#L184-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; 6#L310true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 8#L310-1true check_#res := check_~tmp~1; 49#L330true main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 28#L395true assume !(0 == assert_~arg % 256); 73#L390true main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 62#L368-2true [2019-11-28 21:21:29,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:29,926 INFO L82 PathProgramCache]: Analyzing trace with hash 28826826, now seen corresponding path program 1 times [2019-11-28 21:21:29,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:29,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944720385] [2019-11-28 21:21:29,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:30,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944720385] [2019-11-28 21:21:30,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:30,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:21:30,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815700345] [2019-11-28 21:21:30,153 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:21:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash -293702655, now seen corresponding path program 1 times [2019-11-28 21:21:30,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:30,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535718060] [2019-11-28 21:21:30,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:30,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535718060] [2019-11-28 21:21:30,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:30,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:21:30,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964165756] [2019-11-28 21:21:30,341 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:21:30,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:21:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:21:30,360 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2019-11-28 21:21:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:30,473 INFO L93 Difference]: Finished difference Result 76 states and 123 transitions. [2019-11-28 21:21:30,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:21:30,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 123 transitions. [2019-11-28 21:21:30,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-11-28 21:21:30,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 69 states and 94 transitions. [2019-11-28 21:21:30,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-28 21:21:30,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-11-28 21:21:30,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 94 transitions. [2019-11-28 21:21:30,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:30,504 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 94 transitions. [2019-11-28 21:21:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 94 transitions. [2019-11-28 21:21:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-28 21:21:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 21:21:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2019-11-28 21:21:30,555 INFO L711 BuchiCegarLoop]: Abstraction has 69 states and 94 transitions. [2019-11-28 21:21:30,555 INFO L591 BuchiCegarLoop]: Abstraction has 69 states and 94 transitions. [2019-11-28 21:21:30,555 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:21:30,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 94 transitions. [2019-11-28 21:21:30,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-11-28 21:21:30,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:30,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:30,569 INFO L849 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] [2019-11-28 21:21:30,569 INFO L850 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] [2019-11-28 21:21:30,573 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY ~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]; 179#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 180#L209 assume 0 == ~r1~0; 198#L210 assume ~id1~0 >= 0; 222#L211 assume 0 == ~st1~0; 177#L212 assume ~send1~0 == ~id1~0; 178#L213 assume 0 == ~mode1~0 % 256; 226#L214 assume ~id2~0 >= 0; 184#L215 assume 0 == ~st2~0; 185#L216 assume ~send2~0 == ~id2~0; 215#L217 assume 0 == ~mode2~0 % 256; 230#L218 assume ~id3~0 >= 0; 167#L219 assume 0 == ~st3~0; 168#L220 assume ~send3~0 == ~id3~0; 199#L221 assume 0 == ~mode3~0 % 256; 224#L222 assume ~id4~0 >= 0; 205#L223 assume 0 == ~st4~0; 206#L224 assume ~send4~0 == ~id4~0; 227#L225 assume 0 == ~mode4~0 % 256; 186#L226 assume ~id1~0 != ~id2~0; 187#L227 assume ~id1~0 != ~id3~0; 216#L228 assume ~id1~0 != ~id4~0; 231#L229 assume ~id2~0 != ~id3~0; 169#L230 assume ~id2~0 != ~id4~0; 170#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 192#L209-1 init_#res := init_~tmp~0; 193#L302 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~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; 232#L368-2 [2019-11-28 21:21:30,573 INFO L796 eck$LassoCheckResult]: Loop: 232#L368-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 209#L106 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; 210#L110 assume !(node1_~m1~0 != ~nomsg~0); 201#L110-1 ~mode1~0 := 0; 174#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 175#L134 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 225#L137 assume !(node2_~m2~0 != ~nomsg~0); 182#L137-1 ~mode2~0 := 0; 197#L134-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 233#L159 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 228#L162 assume !(node3_~m3~0 != ~nomsg~0); 220#L162-1 ~mode3~0 := 0; 208#L159-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 223#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 194#L187 assume !(node4_~m4~0 != ~nomsg~0); 191#L187-1 ~mode4~0 := 0; 188#L184-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; 171#L310 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 172#L310-1 check_#res := check_~tmp~1; 176#L330 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 202#L395 assume !(0 == assert_~arg % 256); 203#L390 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 232#L368-2 [2019-11-28 21:21:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 1 times [2019-11-28 21:21:30,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:30,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284470516] [2019-11-28 21:21:30,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:30,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:30,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1849481195, now seen corresponding path program 1 times [2019-11-28 21:21:30,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:30,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492987284] [2019-11-28 21:21:30,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:30,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492987284] [2019-11-28 21:21:30,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:30,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:21:30,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631192255] [2019-11-28 21:21:30,828 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:21:30,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:21:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:21:30,830 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. cyclomatic complexity: 26 Second operand 5 states. [2019-11-28 21:21:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:30,897 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2019-11-28 21:21:30,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:21:30,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-11-28 21:21:30,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-11-28 21:21:30,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 69 states and 91 transitions. [2019-11-28 21:21:30,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-28 21:21:30,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-11-28 21:21:30,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2019-11-28 21:21:30,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:30,906 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-11-28 21:21:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2019-11-28 21:21:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-28 21:21:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 21:21:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2019-11-28 21:21:30,912 INFO L711 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-11-28 21:21:30,912 INFO L591 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-11-28 21:21:30,912 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:21:30,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2019-11-28 21:21:30,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-11-28 21:21:30,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:30,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:30,915 INFO L849 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] [2019-11-28 21:21:30,915 INFO L850 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] [2019-11-28 21:21:30,915 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY ~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]; 332#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 333#L209 assume 0 == ~r1~0; 351#L210 assume ~id1~0 >= 0; 375#L211 assume 0 == ~st1~0; 330#L212 assume ~send1~0 == ~id1~0; 331#L213 assume 0 == ~mode1~0 % 256; 379#L214 assume ~id2~0 >= 0; 337#L215 assume 0 == ~st2~0; 338#L216 assume ~send2~0 == ~id2~0; 368#L217 assume 0 == ~mode2~0 % 256; 383#L218 assume ~id3~0 >= 0; 320#L219 assume 0 == ~st3~0; 321#L220 assume ~send3~0 == ~id3~0; 352#L221 assume 0 == ~mode3~0 % 256; 376#L222 assume ~id4~0 >= 0; 358#L223 assume 0 == ~st4~0; 359#L224 assume ~send4~0 == ~id4~0; 380#L225 assume 0 == ~mode4~0 % 256; 339#L226 assume ~id1~0 != ~id2~0; 340#L227 assume ~id1~0 != ~id3~0; 369#L228 assume ~id1~0 != ~id4~0; 384#L229 assume ~id2~0 != ~id3~0; 322#L230 assume ~id2~0 != ~id4~0; 323#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 345#L209-1 init_#res := init_~tmp~0; 346#L302 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~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; 385#L368-2 [2019-11-28 21:21:30,916 INFO L796 eck$LassoCheckResult]: Loop: 385#L368-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 360#L106 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; 361#L110 assume !(node1_~m1~0 != ~nomsg~0); 354#L110-1 ~mode1~0 := 0; 326#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 327#L134 assume !(0 != ~mode2~0 % 256); 357#L147 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 349#L147-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 350#L134-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 386#L159 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 381#L162 assume !(node3_~m3~0 != ~nomsg~0); 373#L162-1 ~mode3~0 := 0; 364#L159-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 377#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 347#L187 assume !(node4_~m4~0 != ~nomsg~0); 344#L187-1 ~mode4~0 := 0; 341#L184-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; 324#L310 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 325#L311 assume ~r1~0 >= 4; 343#L315 assume ~r1~0 < 4;check_~tmp~1 := 1; 328#L310-1 check_#res := check_~tmp~1; 329#L330 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 355#L395 assume !(0 == assert_~arg % 256); 356#L390 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 385#L368-2 [2019-11-28 21:21:30,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:30,916 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 2 times [2019-11-28 21:21:30,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:30,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929328753] [2019-11-28 21:21:30,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:30,967 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:30,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:30,968 INFO L82 PathProgramCache]: Analyzing trace with hash 544955963, now seen corresponding path program 1 times [2019-11-28 21:21:30,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:30,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769580164] [2019-11-28 21:21:30,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:31,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769580164] [2019-11-28 21:21:31,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:31,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:21:31,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8980084] [2019-11-28 21:21:31,028 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:21:31,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:21:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:21:31,029 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 23 Second operand 3 states. [2019-11-28 21:21:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:31,058 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2019-11-28 21:21:31,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:21:31,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 144 transitions. [2019-11-28 21:21:31,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-28 21:21:31,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 144 transitions. [2019-11-28 21:21:31,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2019-11-28 21:21:31,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-28 21:21:31,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 144 transitions. [2019-11-28 21:21:31,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:31,063 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2019-11-28 21:21:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 144 transitions. [2019-11-28 21:21:31,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-28 21:21:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 21:21:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2019-11-28 21:21:31,071 INFO L711 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2019-11-28 21:21:31,071 INFO L591 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2019-11-28 21:21:31,071 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:21:31,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 144 transitions. [2019-11-28 21:21:31,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-28 21:21:31,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:31,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:31,074 INFO L849 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] [2019-11-28 21:21:31,074 INFO L850 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] [2019-11-28 21:21:31,075 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY ~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]; 512#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 513#L209 assume 0 == ~r1~0; 529#L210 assume ~id1~0 >= 0; 556#L211 assume 0 == ~st1~0; 510#L212 assume ~send1~0 == ~id1~0; 511#L213 assume 0 == ~mode1~0 % 256; 561#L214 assume ~id2~0 >= 0; 517#L215 assume 0 == ~st2~0; 518#L216 assume ~send2~0 == ~id2~0; 548#L217 assume 0 == ~mode2~0 % 256; 565#L218 assume ~id3~0 >= 0; 500#L219 assume 0 == ~st3~0; 501#L220 assume ~send3~0 == ~id3~0; 532#L221 assume 0 == ~mode3~0 % 256; 557#L222 assume ~id4~0 >= 0; 539#L223 assume 0 == ~st4~0; 540#L224 assume ~send4~0 == ~id4~0; 562#L225 assume 0 == ~mode4~0 % 256; 519#L226 assume ~id1~0 != ~id2~0; 520#L227 assume ~id1~0 != ~id3~0; 550#L228 assume ~id1~0 != ~id4~0; 566#L229 assume ~id2~0 != ~id3~0; 502#L230 assume ~id2~0 != ~id4~0; 503#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 525#L209-1 init_#res := init_~tmp~0; 526#L302 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~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; 567#L368-2 [2019-11-28 21:21:31,075 INFO L796 eck$LassoCheckResult]: Loop: 567#L368-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 541#L106 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; 542#L110 assume !(node1_~m1~0 != ~nomsg~0); 535#L110-1 ~mode1~0 := 0; 506#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 507#L134 assume !(0 != ~mode2~0 % 256); 538#L147 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 530#L147-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 531#L134-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 568#L159 assume !(0 != ~mode3~0 % 256); 569#L172 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 582#L172-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 581#L159-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 580#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 578#L187 assume !(node4_~m4~0 != ~nomsg~0); 574#L187-1 ~mode4~0 := 0; 573#L184-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; 572#L310 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 571#L311 assume !(~r1~0 >= 4); 522#L314 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 523#L315 assume ~r1~0 < 4;check_~tmp~1 := 1; 508#L310-1 check_#res := check_~tmp~1; 509#L330 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 536#L395 assume !(0 == assert_~arg % 256); 537#L390 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 567#L368-2 [2019-11-28 21:21:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 3 times [2019-11-28 21:21:31,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:31,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888033242] [2019-11-28 21:21:31,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:31,119 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1447456360, now seen corresponding path program 1 times [2019-11-28 21:21:31,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:31,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614913573] [2019-11-28 21:21:31,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:31,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash -248077372, now seen corresponding path program 1 times [2019-11-28 21:21:31,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:31,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102981565] [2019-11-28 21:21:31,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:31,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102981565] [2019-11-28 21:21:31,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:31,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:21:31,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257967461] [2019-11-28 21:21:31,666 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2019-11-28 21:21:34,236 WARN L192 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 132 DAG size of output: 121 [2019-11-28 21:21:34,259 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:21:34,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:21:34,260 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:21:34,260 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:21:34,260 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:21:34,260 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:34,260 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:21:34,261 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:21:34,261 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2019-11-28 21:21:34,261 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:21:34,261 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:21:34,283 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-28 21:21:34,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,680 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-28 21:21:34,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:34,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:35,074 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-28 21:21:35,089 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 21:21:40,852 WARN L192 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2019-11-28 21:21:40,918 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:21:40,919 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) [2019-11-28 21:21:40,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:21:40,930 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:40,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:21:40,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:21:41,070 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:21:41,073 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:21:41,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:21:41,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:21:41,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:21:41,074 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:21:41,074 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:41,074 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:21:41,074 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:21:41,074 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2019-11-28 21:21:41,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:21:41,074 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:21:41,081 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-28 21:21:41,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,384 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-28 21:21:41,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:41,819 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-28 21:21:41,827 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 21:21:47,555 WARN L192 SmtUtils]: Spent 5.57 s on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2019-11-28 21:21:47,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:21:47,585 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:47,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:21:47,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:47,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:47,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:47,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:47,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:47,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:47,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:47,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:47,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:21:47,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:47,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:47,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:47,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:47,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:47,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:47,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:47,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:21:47,624 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:21:47,624 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:21:47,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:21:47,632 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:21:47,632 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:21:47,633 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-11-28 21:21:47,637 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:47,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:21:47,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:21:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:47,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:21:47,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:21:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:47,882 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 [2019-11-28 21:21:47,883 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 144 transitions. cyclomatic complexity: 40 Second operand 3 states. [2019-11-28 21:21:47,961 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 105 states and 144 transitions. cyclomatic complexity: 40. Second operand 3 states. Result 182 states and 261 transitions. Complement of second has 4 states. [2019-11-28 21:21:47,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:21:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:21:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2019-11-28 21:21:47,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 27 letters. Loop has 25 letters. [2019-11-28 21:21:47,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:21:47,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 52 letters. Loop has 25 letters. [2019-11-28 21:21:47,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:21:47,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 27 letters. Loop has 50 letters. [2019-11-28 21:21:47,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:21:47,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 261 transitions. [2019-11-28 21:21:47,973 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:21:47,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 0 states and 0 transitions. [2019-11-28 21:21:47,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:21:47,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:21:47,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:21:47,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:47,974 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:47,974 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:47,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:47,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:21:47,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:21:47,975 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-28 21:21:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:47,976 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 21:21:47,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 21:21:47,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 21:21:47,976 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:21:47,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 21:21:47,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:21:47,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:21:47,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:21:47,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:47,978 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:47,978 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:47,978 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:47,978 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:21:47,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:21:47,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:21:47,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:21:47,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:21:47 BoogieIcfgContainer [2019-11-28 21:21:47,986 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:21:47,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:21:47,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:21:47,987 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:21:47,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:21:29" (3/4) ... [2019-11-28 21:21:47,991 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:21:47,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:21:47,993 INFO L168 Benchmark]: Toolchain (without parser) took 19446.96 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.7 MB). Free memory was 961.7 MB in the beginning and 900.9 MB in the end (delta: 60.8 MB). Peak memory consumption was 507.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:47,994 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:21:47,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:47,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:21:47,997 INFO L168 Benchmark]: Boogie Preprocessor took 34.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:47,997 INFO L168 Benchmark]: RCFGBuilder took 665.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:47,998 INFO L168 Benchmark]: BuchiAutomizer took 18217.38 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 307.8 MB). Free memory was 1.1 GB in the beginning and 900.9 MB in the end (delta: 188.7 MB). Peak memory consumption was 496.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:47,999 INFO L168 Benchmark]: Witness Printer took 5.21 ms. Allocated memory is still 1.5 GB. Free memory is still 900.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:21:48,003 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 470.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 665.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18217.38 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 307.8 MB). Free memory was 1.1 GB in the beginning and 900.9 MB in the end (delta: 188.7 MB). Peak memory consumption was 496.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.21 ms. Allocated memory is still 1.5 GB. Free memory is still 900.9 MB. There was no memory consumed. Max. memory is 11.5 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 18.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 17.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 105 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 438 SDtfs, 207 SDslu, 628 SDs, 0 SdLazy, 32 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital1210 mio100 ax104 hnf100 lsp11 ukn67 mio100 lsp100 div162 bol100 ite100 ukn100 eq171 hnf69 smp100 dnf5114 smp24 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...