./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.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 b48447b6a7618cb0e36862bcd70ec2f51928799c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:47:34,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:47:34,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:47:34,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:47:34,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:47:34,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:47:34,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:47:34,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:47:34,803 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:47:34,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:47:34,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:47:34,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:47:34,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:47:34,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:47:34,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:47:34,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:47:34,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:47:34,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:47:34,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:47:34,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:47:34,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:47:34,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:47:34,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:47:34,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:47:34,822 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:47:34,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:47:34,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:47:34,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:47:34,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:47:34,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:47:34,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:47:34,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:47:34,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:47:34,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:47:34,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:47:34,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:47:34,833 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:47:34,850 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:47:34,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:47:34,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:47:34,852 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:47:34,853 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:47:34,853 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:47:34,853 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:47:34,854 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:47:34,854 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:47:34,854 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:47:34,855 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:47:34,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:47:34,855 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:47:34,855 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:47:34,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:47:34,856 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:47:34,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:47:34,856 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:47:34,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:47:34,856 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:47:34,856 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:47:34,857 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:47:34,858 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:47:34,858 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:47:34,859 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:47:34,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:47:34,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:47:34,860 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:47:34,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:47:34,860 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:47:34,860 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:47:34,861 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:47:34,861 INFO L133 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 -> b48447b6a7618cb0e36862bcd70ec2f51928799c [2019-01-14 04:47:34,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:47:34,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:47:34,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:47:34,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:47:34,940 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:47:34,941 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2019-01-14 04:47:34,987 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48083bef/a6562138242041f7a953852731b1653f/FLAGbf1cee5fc [2019-01-14 04:47:35,490 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:47:35,491 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2019-01-14 04:47:35,509 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48083bef/a6562138242041f7a953852731b1653f/FLAGbf1cee5fc [2019-01-14 04:47:35,828 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48083bef/a6562138242041f7a953852731b1653f [2019-01-14 04:47:35,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:47:35,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:47:35,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:35,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:47:35,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:47:35,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:35" (1/1) ... [2019-01-14 04:47:35,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:35, skipping insertion in model container [2019-01-14 04:47:35,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:35" (1/1) ... [2019-01-14 04:47:35,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:47:35,898 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:47:36,197 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:36,211 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:47:36,288 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:36,312 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:47:36,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36 WrapperNode [2019-01-14 04:47:36,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:36,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:36,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:47:36,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:47:36,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (1/1) ... [2019-01-14 04:47:36,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (1/1) ... [2019-01-14 04:47:36,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:36,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:47:36,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:47:36,454 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:47:36,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (1/1) ... [2019-01-14 04:47:36,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (1/1) ... [2019-01-14 04:47:36,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (1/1) ... [2019-01-14 04:47:36,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (1/1) ... [2019-01-14 04:47:36,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (1/1) ... [2019-01-14 04:47:36,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (1/1) ... [2019-01-14 04:47:36,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (1/1) ... [2019-01-14 04:47:36,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:47:36,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:47:36,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:47:36,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:47:36,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (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-01-14 04:47:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:47:36,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:47:37,544 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:47:37,544 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-01-14 04:47:37,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:37 BoogieIcfgContainer [2019-01-14 04:47:37,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:47:37,546 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:47:37,546 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:47:37,549 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:47:37,550 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:37,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:47:35" (1/3) ... [2019-01-14 04:47:37,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d2088a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:47:37, skipping insertion in model container [2019-01-14 04:47:37,552 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:37,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:36" (2/3) ... [2019-01-14 04:47:37,553 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d2088a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:47:37, skipping insertion in model container [2019-01-14 04:47:37,553 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:37,553 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:37" (3/3) ... [2019-01-14 04:47:37,555 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2019-01-14 04:47:37,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:47:37,603 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:47:37,603 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:47:37,604 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:47:37,604 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:47:37,604 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:47:37,604 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:47:37,604 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:47:37,604 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:47:37,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-01-14 04:47:37,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2019-01-14 04:47:37,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:37,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:37,662 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:47:37,662 INFO L868 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-01-14 04:47:37,662 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:47:37,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-01-14 04:47:37,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2019-01-14 04:47:37,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:37,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:37,670 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:47:37,671 INFO L868 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-01-14 04:47:37,679 INFO L794 eck$LassoCheckResult]: Stem: 34#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]; 12#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; 57#L207true assume !(0 == ~r1~0);init_~tmp~0 := 0; 75#L207-1true init_#res := init_~tmp~0; 38#L300true 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; 26#L366-2true [2019-01-14 04:47:37,680 INFO L796 eck$LassoCheckResult]: Loop: 26#L366-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 33#L106true assume !(0 != ~mode1~0 % 256); 20#L120true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 15#L120-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 10#L106-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 44#L132true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 8#L135true assume !(node2_~m2~0 != ~nomsg~0); 7#L135-1true ~mode2~0 := 0; 39#L132-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 9#L157true assume !(0 != ~mode3~0 % 256); 69#L170true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 49#L170-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; 6#L157-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 16#L182true assume !(0 != ~mode4~0 % 256); 54#L195true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 53#L195-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; 68#L182-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; 32#L308true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 35#L308-1true check_#res := check_~tmp~1; 70#L328true 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; 50#L393true assume !(0 == assert_~arg % 256); 23#L388true main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 26#L366-2true [2019-01-14 04:47:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash 28826826, now seen corresponding path program 1 times [2019-01-14 04:47:37,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:37,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:37,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:37,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:37,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:37,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:37,890 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:47:37,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:37,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2061233783, now seen corresponding path program 1 times [2019-01-14 04:47:37,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:37,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:37,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:37,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:38,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:38,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:47:38,069 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:47:38,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:47:38,086 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2019-01-14 04:47:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:38,236 INFO L93 Difference]: Finished difference Result 76 states and 123 transitions. [2019-01-14 04:47:38,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:47:38,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 123 transitions. [2019-01-14 04:47:38,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-01-14 04:47:38,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 69 states and 94 transitions. [2019-01-14 04:47:38,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-01-14 04:47:38,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-01-14 04:47:38,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 94 transitions. [2019-01-14 04:47:38,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:38,261 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 94 transitions. [2019-01-14 04:47:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 94 transitions. [2019-01-14 04:47:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 04:47:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 04:47:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2019-01-14 04:47:38,299 INFO L729 BuchiCegarLoop]: Abstraction has 69 states and 94 transitions. [2019-01-14 04:47:38,300 INFO L609 BuchiCegarLoop]: Abstraction has 69 states and 94 transitions. [2019-01-14 04:47:38,300 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:47:38,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 94 transitions. [2019-01-14 04:47:38,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-01-14 04:47:38,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:38,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:38,305 INFO L867 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-01-14 04:47:38,305 INFO L868 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-01-14 04:47:38,306 INFO L794 eck$LassoCheckResult]: Stem: 213#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]; 186#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; 187#L207 assume 0 == ~r1~0; 168#L208 assume ~id1~0 >= 0; 169#L209 assume 0 == ~st1~0; 200#L210 assume ~send1~0 == ~id1~0; 221#L211 assume 0 == ~mode1~0 % 256; 183#L212 assume ~id2~0 >= 0; 184#L213 assume 0 == ~st2~0; 225#L214 assume ~send2~0 == ~id2~0; 192#L215 assume 0 == ~mode2~0 % 256; 193#L216 assume ~id3~0 >= 0; 215#L217 assume 0 == ~st3~0; 229#L218 assume ~send3~0 == ~id3~0; 172#L219 assume 0 == ~mode3~0 % 256; 173#L220 assume ~id4~0 >= 0; 201#L221 assume 0 == ~st4~0; 222#L222 assume ~send4~0 == ~id4~0; 209#L223 assume 0 == ~mode4~0 % 256; 210#L224 assume ~id1~0 != ~id2~0; 226#L225 assume ~id1~0 != ~id3~0; 194#L226 assume ~id1~0 != ~id4~0; 195#L227 assume ~id2~0 != ~id3~0; 216#L228 assume ~id2~0 != ~id4~0; 230#L229 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 233#L207-1 init_#res := init_~tmp~0; 214#L300 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; 199#L366-2 [2019-01-14 04:47:38,306 INFO L796 eck$LassoCheckResult]: Loop: 199#L366-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 202#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; 211#L110 assume !(node1_~m1~0 != ~nomsg~0); 204#L110-1 ~mode1~0 := 0; 181#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 182#L132 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 176#L135 assume !(node2_~m2~0 != ~nomsg~0); 174#L135-1 ~mode2~0 := 0; 175#L132-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 178#L157 assume !(0 != ~mode3~0 % 256); 179#L170 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 223#L170-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; 170#L157-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 171#L182 assume !(0 != ~mode4~0 % 256); 189#L195 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 227#L195-2 ~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; 228#L182-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; 206#L308 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 207#L308-1 check_#res := check_~tmp~1; 212#L328 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; 224#L393 assume !(0 == assert_~arg % 256); 198#L388 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 199#L366-2 [2019-01-14 04:47:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:38,307 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 1 times [2019-01-14 04:47:38,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:38,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:38,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:38,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:38,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:38,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash -293702655, now seen corresponding path program 1 times [2019-01-14 04:47:38,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:38,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:38,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:38,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:38,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:38,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:47:38,688 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:38,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:47:38,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:47:38,689 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. cyclomatic complexity: 26 Second operand 5 states. [2019-01-14 04:47:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:38,787 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2019-01-14 04:47:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:47:38,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-01-14 04:47:38,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-01-14 04:47:38,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 69 states and 91 transitions. [2019-01-14 04:47:38,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-01-14 04:47:38,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-01-14 04:47:38,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2019-01-14 04:47:38,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:38,797 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-01-14 04:47:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2019-01-14 04:47:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 04:47:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 04:47:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2019-01-14 04:47:38,804 INFO L729 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-01-14 04:47:38,804 INFO L609 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-01-14 04:47:38,804 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:47:38,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2019-01-14 04:47:38,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-01-14 04:47:38,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:38,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:38,809 INFO L867 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-01-14 04:47:38,809 INFO L868 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-01-14 04:47:38,810 INFO L794 eck$LassoCheckResult]: Stem: 366#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]; 339#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; 340#L207 assume 0 == ~r1~0; 321#L208 assume ~id1~0 >= 0; 322#L209 assume 0 == ~st1~0; 353#L210 assume ~send1~0 == ~id1~0; 374#L211 assume 0 == ~mode1~0 % 256; 336#L212 assume ~id2~0 >= 0; 337#L213 assume 0 == ~st2~0; 378#L214 assume ~send2~0 == ~id2~0; 345#L215 assume 0 == ~mode2~0 % 256; 346#L216 assume ~id3~0 >= 0; 368#L217 assume 0 == ~st3~0; 382#L218 assume ~send3~0 == ~id3~0; 323#L219 assume 0 == ~mode3~0 % 256; 324#L220 assume ~id4~0 >= 0; 354#L221 assume 0 == ~st4~0; 375#L222 assume ~send4~0 == ~id4~0; 359#L223 assume 0 == ~mode4~0 % 256; 360#L224 assume ~id1~0 != ~id2~0; 379#L225 assume ~id1~0 != ~id3~0; 347#L226 assume ~id1~0 != ~id4~0; 348#L227 assume ~id2~0 != ~id3~0; 369#L228 assume ~id2~0 != ~id4~0; 383#L229 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 386#L207-1 init_#res := init_~tmp~0; 367#L300 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; 352#L366-2 [2019-01-14 04:47:38,811 INFO L796 eck$LassoCheckResult]: Loop: 352#L366-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 355#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; 363#L110 assume !(node1_~m1~0 != ~nomsg~0); 357#L110-1 ~mode1~0 := 0; 334#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 335#L132 assume !(0 != ~mode2~0 % 256); 371#L145 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 384#L145-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; 328#L132-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 331#L157 assume !(0 != ~mode3~0 % 256); 332#L170 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 376#L170-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; 325#L157-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 326#L182 assume !(0 != ~mode4~0 % 256); 343#L195 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 380#L195-2 ~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; 381#L182-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; 361#L308 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 362#L309 assume ~r1~0 >= 4; 373#L313 assume ~r1~0 < 4;check_~tmp~1 := 1; 364#L308-1 check_#res := check_~tmp~1; 365#L328 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; 377#L393 assume !(0 == assert_~arg % 256); 351#L388 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 352#L366-2 [2019-01-14 04:47:38,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 2 times [2019-01-14 04:47:38,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:38,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:38,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:38,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:38,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:38,867 INFO L82 PathProgramCache]: Analyzing trace with hash 999513895, now seen corresponding path program 1 times [2019-01-14 04:47:38,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:38,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:38,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:47:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:38,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:38,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:38,935 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:38,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:47:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:47:38,938 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 23 Second operand 3 states. [2019-01-14 04:47:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:38,989 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2019-01-14 04:47:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:47:38,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 144 transitions. [2019-01-14 04:47:38,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-14 04:47:38,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 144 transitions. [2019-01-14 04:47:38,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2019-01-14 04:47:38,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-01-14 04:47:38,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 144 transitions. [2019-01-14 04:47:38,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:38,999 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2019-01-14 04:47:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 144 transitions. [2019-01-14 04:47:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-14 04:47:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 04:47:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2019-01-14 04:47:39,008 INFO L729 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2019-01-14 04:47:39,008 INFO L609 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2019-01-14 04:47:39,008 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:47:39,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 144 transitions. [2019-01-14 04:47:39,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-14 04:47:39,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:39,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:39,014 INFO L867 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-01-14 04:47:39,014 INFO L868 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-01-14 04:47:39,014 INFO L794 eck$LassoCheckResult]: Stem: 545#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]; 518#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; 519#L207 assume 0 == ~r1~0; 501#L208 assume ~id1~0 >= 0; 502#L209 assume 0 == ~st1~0; 534#L210 assume ~send1~0 == ~id1~0; 557#L211 assume 0 == ~mode1~0 % 256; 516#L212 assume ~id2~0 >= 0; 517#L213 assume 0 == ~st2~0; 561#L214 assume ~send2~0 == ~id2~0; 526#L215 assume 0 == ~mode2~0 % 256; 527#L216 assume ~id3~0 >= 0; 551#L217 assume 0 == ~st3~0; 565#L218 assume ~send3~0 == ~id3~0; 503#L219 assume 0 == ~mode3~0 % 256; 504#L220 assume ~id4~0 >= 0; 535#L221 assume 0 == ~st4~0; 558#L222 assume ~send4~0 == ~id4~0; 540#L223 assume 0 == ~mode4~0 % 256; 541#L224 assume ~id1~0 != ~id2~0; 562#L225 assume ~id1~0 != ~id3~0; 528#L226 assume ~id1~0 != ~id4~0; 529#L227 assume ~id2~0 != ~id3~0; 552#L228 assume ~id2~0 != ~id4~0; 566#L229 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 570#L207-1 init_#res := init_~tmp~0; 548#L300 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; 549#L366-2 [2019-01-14 04:47:39,014 INFO L796 eck$LassoCheckResult]: Loop: 549#L366-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 596#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; 544#L110 assume !(node1_~m1~0 != ~nomsg~0); 538#L110-1 ~mode1~0 := 0; 550#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 592#L132 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 593#L135 assume !(node2_~m2~0 != ~nomsg~0); 590#L135-1 ~mode2~0 := 0; 588#L132-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 587#L157 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 585#L160 assume !(node3_~m3~0 != ~nomsg~0); 582#L160-1 ~mode3~0 := 0; 505#L157-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 506#L182 assume !(0 != ~mode4~0 % 256); 524#L195 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 563#L195-2 ~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; 564#L182-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; 573#L308 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 572#L309 assume !(~r1~0 >= 4); 555#L312 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 556#L313 assume ~r1~0 < 4;check_~tmp~1 := 1; 600#L308-1 check_#res := check_~tmp~1; 599#L328 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; 598#L393 assume !(0 == assert_~arg % 256); 597#L388 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 549#L366-2 [2019-01-14 04:47:39,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:39,017 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 3 times [2019-01-14 04:47:39,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:39,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:39,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:39,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:39,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:39,066 INFO L82 PathProgramCache]: Analyzing trace with hash -228752226, now seen corresponding path program 1 times [2019-01-14 04:47:39,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:39,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:39,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:47:39,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1924285958, now seen corresponding path program 1 times [2019-01-14 04:47:39,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:39,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:39,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:39,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:40,146 WARN L181 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 123 [2019-01-14 04:47:41,807 WARN L181 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 118 DAG size of output: 111 [2019-01-14 04:47:41,841 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:47:41,843 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:47:41,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:47:41,843 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:47:41,843 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:47:41,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:41,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:47:41,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:47:41,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:47:41,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:47:41,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:47:41,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:41,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:41,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:41,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:41,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:41,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:41,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:41,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,089 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-01-14 04:47:42,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,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-01-14 04:47:42,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-01-14 04:47:42,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-01-14 04:47:42,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-01-14 04:47:42,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:42,500 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-14 04:47:44,164 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-01-14 04:47:44,269 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2019-01-14 04:47:44,475 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:47:44,476 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:44,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:47:44,488 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:44,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:47:44,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:47:44,637 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:47:44,639 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:47:44,640 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:47:44,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:47:44,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:47:44,640 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:47:44,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:44,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:47:44,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:47:44,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:47:44,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:47:44,641 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:47:44,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,825 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-01-14 04:47:44,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:44,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:45,178 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-14 04:47:45,402 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-14 04:47:46,660 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-01-14 04:47:46,813 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:47:46,820 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:47:46,822 INFO L122 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-01-14 04:47:46,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:46,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:46,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:46,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:46,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:46,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:46,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:46,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:46,832 INFO L122 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-01-14 04:47:46,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:46,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:46,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:46,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:46,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:46,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:46,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:46,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:46,842 INFO L122 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-01-14 04:47:46,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:46,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:46,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:46,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:46,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:46,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:46,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:46,850 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:47:46,855 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:47:46,855 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:47:46,858 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:47:46,858 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:47:46,859 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:47:46,860 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-01-14 04:47:46,862 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:47:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:47,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:47:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:47,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:47:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:47,146 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-01-14 04:47:47,147 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 144 transitions. cyclomatic complexity: 40 Second operand 3 states. [2019-01-14 04:47:47,215 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-01-14 04:47:47,217 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-01-14 04:47:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:47:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2019-01-14 04:47:47,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 27 letters. Loop has 25 letters. [2019-01-14 04:47:47,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:47:47,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 52 letters. Loop has 25 letters. [2019-01-14 04:47:47,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:47:47,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 27 letters. Loop has 50 letters. [2019-01-14 04:47:47,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:47:47,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 261 transitions. [2019-01-14 04:47:47,227 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:47:47,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 0 states and 0 transitions. [2019-01-14 04:47:47,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:47:47,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:47:47,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:47:47,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:47,228 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:47,229 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:47,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:47:47,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:47:47,230 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:47:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:47,230 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:47:47,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:47:47,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:47:47,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:47:47,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:47:47,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:47:47,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:47:47,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:47:47,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:47,234 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:47,234 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:47,234 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:47,234 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:47:47,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:47:47,234 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:47:47,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:47:47,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:47:47 BoogieIcfgContainer [2019-01-14 04:47:47,240 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:47:47,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:47:47,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:47:47,241 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:47:47,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:37" (3/4) ... [2019-01-14 04:47:47,247 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:47:47,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:47:47,248 INFO L168 Benchmark]: Toolchain (without parser) took 11415.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.3 MB). Free memory was 952.7 MB in the beginning and 855.3 MB in the end (delta: 97.4 MB). Peak memory consumption was 395.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:47,249 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:47:47,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.57 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:47,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:47,253 INFO L168 Benchmark]: Boogie Preprocessor took 49.51 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-01-14 04:47:47,254 INFO L168 Benchmark]: RCFGBuilder took 1041.81 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.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:47,255 INFO L168 Benchmark]: BuchiAutomizer took 9694.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 855.3 MB in the end (delta: 232.5 MB). Peak memory consumption was 398.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:47,257 INFO L168 Benchmark]: Witness Printer took 6.59 ms. Allocated memory is still 1.3 GB. Free memory is still 855.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:47:47,263 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 478.57 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1041.81 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.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9694.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 855.3 MB in the end (delta: 232.5 MB). Peak memory consumption was 398.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.59 ms. Allocated memory is still 1.3 GB. Free memory is still 855.3 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 9.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 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.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital562 mio100 ax108 hnf101 lsp15 ukn75 mio100 lsp100 div144 bol100 ite100 ukn100 eq183 hnf73 smp100 dnf691 smp48 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 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...