./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer --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 5564e2866529becd702f0ed3cd0d2d94f195a7b8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:53:13,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:53:13,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:53:13,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:53:13,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:53:13,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:53:13,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:53:13,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:53:13,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:53:13,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:53:13,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:53:13,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:53:13,826 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:53:13,827 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:53:13,828 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:53:13,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:53:13,829 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:53:13,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:53:13,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:53:13,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:53:13,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:53:13,835 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:53:13,837 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:53:13,837 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:53:13,837 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:53:13,838 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:53:13,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:53:13,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:53:13,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:53:13,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:53:13,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:53:13,841 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:53:13,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:53:13,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:53:13,842 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:53:13,843 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:53:13,843 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:53:13,854 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:53:13,854 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:53:13,855 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:53:13,855 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:53:13,855 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:53:13,855 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:53:13,856 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:53:13,856 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:53:13,856 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:53:13,856 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:53:13,856 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:53:13,856 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:53:13,857 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:53:13,857 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:53:13,857 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:53:13,857 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:53:13,857 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:53:13,857 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:53:13,857 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:53:13,858 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:53:13,858 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:53:13,858 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:53:13,858 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:53:13,858 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:53:13,858 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:53:13,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:53:13,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:53:13,859 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:53:13,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:53:13,859 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:53:13,859 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:53:13,860 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:53:13,860 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer 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 -> 5564e2866529becd702f0ed3cd0d2d94f195a7b8 [2018-11-28 11:53:13,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:53:13,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:53:13,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:53:13,896 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:53:13,896 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:53:13,897 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-28 11:53:13,940 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/data/441e5841f/52800a144c68471dbb39d69ae9f89fe7/FLAG17afd981d [2018-11-28 11:53:14,358 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:53:14,359 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-28 11:53:14,364 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/data/441e5841f/52800a144c68471dbb39d69ae9f89fe7/FLAG17afd981d [2018-11-28 11:53:14,373 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/data/441e5841f/52800a144c68471dbb39d69ae9f89fe7 [2018-11-28 11:53:14,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:53:14,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:53:14,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:53:14,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:53:14,379 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:53:14,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6022eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14, skipping insertion in model container [2018-11-28 11:53:14,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:53:14,412 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:53:14,550 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:53:14,556 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:53:14,639 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:53:14,652 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:53:14,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14 WrapperNode [2018-11-28 11:53:14,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:53:14,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:53:14,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:53:14,653 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:53:14,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:53:14,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:53:14,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:53:14,696 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:53:14,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... [2018-11-28 11:53:14,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:53:14,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:53:14,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:53:14,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:53:14,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/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 [2018-11-28 11:53:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:53:14,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:53:15,296 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:53:15,296 INFO L280 CfgBuilder]: Removed 23 assue(true) statements. [2018-11-28 11:53:15,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:53:15 BoogieIcfgContainer [2018-11-28 11:53:15,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:53:15,297 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:53:15,297 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:53:15,299 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:53:15,300 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:53:15,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:53:14" (1/3) ... [2018-11-28 11:53:15,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33bc86ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:53:15, skipping insertion in model container [2018-11-28 11:53:15,301 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:53:15,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:14" (2/3) ... [2018-11-28 11:53:15,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33bc86ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:53:15, skipping insertion in model container [2018-11-28 11:53:15,301 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:53:15,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:53:15" (3/3) ... [2018-11-28 11:53:15,303 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-28 11:53:15,336 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:53:15,337 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:53:15,337 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:53:15,337 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:53:15,337 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:53:15,337 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:53:15,337 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:53:15,337 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:53:15,337 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:53:15,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2018-11-28 11:53:15,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-28 11:53:15,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:15,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:15,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:53:15,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:15,377 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:53:15,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2018-11-28 11:53:15,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-28 11:53:15,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:15,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:15,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:53:15,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:15,389 INFO L794 eck$LassoCheckResult]: Stem: 105#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;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 14#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 43#L334true assume !(0 == ~r1~0);init_~tmp~0 := 0; 45#L334-1true init_#res := init_~tmp~0; 51#L499true main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 106#L575-2true [2018-11-28 11:53:15,390 INFO L796 eck$LassoCheckResult]: Loop: 106#L575-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 118#L126true 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 71#L130true assume !(node1_~m1~0 != ~nomsg~0); 69#L130-1true ~mode1~0 := 0; 112#L126-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 75#L163true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 46#L166true assume !(node2_~m2~0 != ~nomsg~0); 44#L166-1true ~mode2~0 := 0; 70#L163-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 4#L197true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 133#L200true assume !(node3_~m3~0 != ~nomsg~0); 132#L200-1true ~mode3~0 := 0; 21#L197-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 102#L231true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 104#L234true assume !(node4_~m4~0 != ~nomsg~0); 83#L234-1true ~mode4~0 := 0; 97#L231-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 48#L265true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 54#L268true assume !(node5_~m5~0 != ~nomsg~0); 53#L268-1true ~mode5~0 := 0; 47#L265-2true havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 17#L299true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 142#L302true assume !(node6_~m6~0 != ~nomsg~0); 139#L302-1true ~mode6~0 := 0; 134#L299-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 74#L507true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 77#L507-1true check_#res := check_~tmp~1; 18#L519true main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 117#L608true assume !(0 == assert_~arg % 256); 93#L603true main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 106#L575-2true [2018-11-28 11:53:15,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash 28934070, now seen corresponding path program 1 times [2018-11-28 11:53:15,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:15,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:15,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:15,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:15,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:15,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:53:15,545 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:53:15,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash -885212333, now seen corresponding path program 1 times [2018-11-28 11:53:15,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:15,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:15,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:15,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:15,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:53:15,624 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:15,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:53:15,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:53:15,634 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 4 states. [2018-11-28 11:53:15,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:15,720 INFO L93 Difference]: Finished difference Result 144 states and 241 transitions. [2018-11-28 11:53:15,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:53:15,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 241 transitions. [2018-11-28 11:53:15,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-28 11:53:15,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 137 states and 194 transitions. [2018-11-28 11:53:15,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-28 11:53:15,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-11-28 11:53:15,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 194 transitions. [2018-11-28 11:53:15,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:15,733 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2018-11-28 11:53:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 194 transitions. [2018-11-28 11:53:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-11-28 11:53:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-28 11:53:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2018-11-28 11:53:15,763 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2018-11-28 11:53:15,763 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2018-11-28 11:53:15,763 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:53:15,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 194 transitions. [2018-11-28 11:53:15,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-28 11:53:15,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:15,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:15,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:15,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:15,768 INFO L794 eck$LassoCheckResult]: Stem: 429#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;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 321#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 322#L334 assume 0 == ~r1~0; 372#L335 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 425#L336 assume ~id1~0 >= 0; 362#L337 assume 0 == ~st1~0; 363#L338 assume ~send1~0 == ~id1~0; 403#L339 assume 0 == ~mode1~0 % 256; 323#L340 assume ~id2~0 >= 0; 324#L341 assume 0 == ~st2~0; 397#L342 assume ~send2~0 == ~id2~0; 313#L343 assume 0 == ~mode2~0 % 256; 314#L344 assume ~id3~0 >= 0; 370#L345 assume 0 == ~st3~0; 371#L346 assume ~send3~0 == ~id3~0; 423#L347 assume 0 == ~mode3~0 % 256; 359#L348 assume ~id4~0 >= 0; 360#L349 assume 0 == ~st4~0; 402#L350 assume ~send4~0 == ~id4~0; 346#L351 assume 0 == ~mode4~0 % 256; 347#L352 assume ~id5~0 >= 0; 396#L353 assume 0 == ~st5~0; 310#L354 assume ~send5~0 == ~id5~0; 311#L355 assume 0 == ~mode5~0 % 256; 368#L356 assume ~id6~0 >= 0; 369#L357 assume 0 == ~st6~0; 421#L358 assume ~send6~0 == ~id6~0; 356#L359 assume 0 == ~mode6~0 % 256; 357#L360 assume ~id1~0 != ~id2~0; 401#L361 assume ~id1~0 != ~id3~0; 344#L362 assume ~id1~0 != ~id4~0; 345#L363 assume ~id1~0 != ~id5~0; 395#L364 assume ~id1~0 != ~id6~0; 308#L365 assume ~id2~0 != ~id3~0; 309#L366 assume ~id2~0 != ~id4~0; 389#L367 assume ~id2~0 != ~id5~0; 390#L368 assume ~id2~0 != ~id6~0; 420#L369 assume ~id3~0 != ~id4~0; 354#L370 assume ~id3~0 != ~id5~0; 355#L371 assume ~id3~0 != ~id6~0; 400#L372 assume ~id4~0 != ~id5~0; 342#L373 assume ~id4~0 != ~id6~0; 343#L374 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 374#L334-1 init_#res := init_~tmp~0; 375#L499 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 383#L575-2 [2018-11-28 11:53:15,768 INFO L796 eck$LassoCheckResult]: Loop: 383#L575-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 431#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 406#L130 assume !(node1_~m1~0 != ~nomsg~0); 334#L130-1 ~mode1~0 := 0; 399#L126-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 409#L163 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 376#L166 assume !(node2_~m2~0 != ~nomsg~0); 373#L166-1 ~mode2~0 := 0; 352#L163-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 303#L197 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 305#L200 assume !(node3_~m3~0 != ~nomsg~0); 365#L200-1 ~mode3~0 := 0; 336#L197-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 337#L231 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 428#L234 assume !(node4_~m4~0 != ~nomsg~0); 386#L234-1 ~mode4~0 := 0; 410#L231-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 378#L265 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 379#L268 assume !(node5_~m5~0 != ~nomsg~0); 384#L268-1 ~mode5~0 := 0; 307#L265-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 327#L299 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 329#L302 assume !(node6_~m6~0 != ~nomsg~0); 326#L302-1 ~mode6~0 := 0; 430#L299-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 407#L507 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 318#L507-1 check_#res := check_~tmp~1; 330#L519 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 331#L608 assume !(0 == assert_~arg % 256); 422#L603 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 383#L575-2 [2018-11-28 11:53:15,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 1 times [2018-11-28 11:53:15,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:15,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:15,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:15,855 INFO L82 PathProgramCache]: Analyzing trace with hash -885212333, now seen corresponding path program 2 times [2018-11-28 11:53:15,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:15,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:15,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:15,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:15,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:15,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:53:15,904 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:15,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:53:15,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:53:15,904 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. cyclomatic complexity: 58 Second operand 5 states. [2018-11-28 11:53:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:15,969 INFO L93 Difference]: Finished difference Result 140 states and 196 transitions. [2018-11-28 11:53:15,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:53:15,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 196 transitions. [2018-11-28 11:53:15,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-28 11:53:15,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 192 transitions. [2018-11-28 11:53:15,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-28 11:53:15,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-11-28 11:53:15,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 192 transitions. [2018-11-28 11:53:15,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:15,974 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 192 transitions. [2018-11-28 11:53:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 192 transitions. [2018-11-28 11:53:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-11-28 11:53:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-28 11:53:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2018-11-28 11:53:15,980 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 192 transitions. [2018-11-28 11:53:15,980 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 192 transitions. [2018-11-28 11:53:15,980 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:53:15,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 192 transitions. [2018-11-28 11:53:15,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-28 11:53:15,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:15,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:15,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:15,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:15,982 INFO L794 eck$LassoCheckResult]: Stem: 718#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;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 610#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 611#L334 assume 0 == ~r1~0; 661#L335 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 714#L336 assume ~id1~0 >= 0; 651#L337 assume 0 == ~st1~0; 652#L338 assume ~send1~0 == ~id1~0; 692#L339 assume 0 == ~mode1~0 % 256; 612#L340 assume ~id2~0 >= 0; 613#L341 assume 0 == ~st2~0; 686#L342 assume ~send2~0 == ~id2~0; 602#L343 assume 0 == ~mode2~0 % 256; 603#L344 assume ~id3~0 >= 0; 659#L345 assume 0 == ~st3~0; 660#L346 assume ~send3~0 == ~id3~0; 713#L347 assume 0 == ~mode3~0 % 256; 648#L348 assume ~id4~0 >= 0; 649#L349 assume 0 == ~st4~0; 691#L350 assume ~send4~0 == ~id4~0; 635#L351 assume 0 == ~mode4~0 % 256; 636#L352 assume ~id5~0 >= 0; 685#L353 assume 0 == ~st5~0; 599#L354 assume ~send5~0 == ~id5~0; 600#L355 assume 0 == ~mode5~0 % 256; 657#L356 assume ~id6~0 >= 0; 658#L357 assume 0 == ~st6~0; 710#L358 assume ~send6~0 == ~id6~0; 645#L359 assume 0 == ~mode6~0 % 256; 646#L360 assume ~id1~0 != ~id2~0; 690#L361 assume ~id1~0 != ~id3~0; 633#L362 assume ~id1~0 != ~id4~0; 634#L363 assume ~id1~0 != ~id5~0; 684#L364 assume ~id1~0 != ~id6~0; 597#L365 assume ~id2~0 != ~id3~0; 598#L366 assume ~id2~0 != ~id4~0; 678#L367 assume ~id2~0 != ~id5~0; 679#L368 assume ~id2~0 != ~id6~0; 709#L369 assume ~id3~0 != ~id4~0; 643#L370 assume ~id3~0 != ~id5~0; 644#L371 assume ~id3~0 != ~id6~0; 689#L372 assume ~id4~0 != ~id5~0; 631#L373 assume ~id4~0 != ~id6~0; 632#L374 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 663#L334-1 init_#res := init_~tmp~0; 664#L499 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 672#L575-2 [2018-11-28 11:53:15,982 INFO L796 eck$LassoCheckResult]: Loop: 672#L575-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 720#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 695#L130 assume !(node1_~m1~0 != ~nomsg~0); 625#L130-1 ~mode1~0 := 0; 688#L126-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 698#L163 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 665#L166 assume !(node2_~m2~0 != ~nomsg~0); 662#L166-1 ~mode2~0 := 0; 641#L163-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 592#L197 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 594#L200 assume !(node3_~m3~0 != ~nomsg~0); 654#L200-1 ~mode3~0 := 0; 622#L197-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 623#L231 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 717#L234 assume !(node4_~m4~0 != ~nomsg~0); 674#L234-1 ~mode4~0 := 0; 699#L231-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 667#L265 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 668#L268 assume !(node5_~m5~0 != ~nomsg~0); 676#L268-1 ~mode5~0 := 0; 596#L265-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 616#L299 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 618#L302 assume !(node6_~m6~0 != ~nomsg~0); 615#L302-1 ~mode6~0 := 0; 719#L299-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 697#L507 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 621#L508 assume ~r1~0 < 6;check_~tmp~1 := 1; 607#L507-1 check_#res := check_~tmp~1; 619#L519 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 620#L608 assume !(0 == assert_~arg % 256); 712#L603 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 672#L575-2 [2018-11-28 11:53:15,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 2 times [2018-11-28 11:53:15,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:15,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:15,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:15,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:16,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2055105496, now seen corresponding path program 1 times [2018-11-28 11:53:16,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:16,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:16,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:16,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:16,051 INFO L82 PathProgramCache]: Analyzing trace with hash -122585655, now seen corresponding path program 1 times [2018-11-28 11:53:16,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:16,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:16,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:16,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:16,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:53:16,473 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2018-11-28 11:53:17,106 WARN L180 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2018-11-28 11:53:17,114 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:17,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:17,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:17,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:17,115 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:53:17,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:17,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:17,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:17,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2018-11-28 11:53:17,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:17,116 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:17,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,702 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:17,702 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/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 [2018-11-28 11:53:17,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:17,709 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0d52c3-fac4-4dc4-833d-90d883fad143/bin-2019/uautomizer/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 [2018-11-28 11:53:17,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:53:17,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:17,843 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:53:17,845 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:17,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:17,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:17,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:17,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:17,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:17,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:17,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:17,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2018-11-28 11:53:17,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:17,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:17,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:17,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:18,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:18,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:18,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:18,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:18,284 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-28 11:53:18,467 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:18,471 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:18,472 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 [2018-11-28 11:53:18,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,478 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 [2018-11-28 11:53:18,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:18,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:18,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,483 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 [2018-11-28 11:53:18,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,485 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 [2018-11-28 11:53:18,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:18,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:18,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,489 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 [2018-11-28 11:53:18,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,492 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 [2018-11-28 11:53:18,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,494 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 [2018-11-28 11:53:18,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:18,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:18,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,498 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 [2018-11-28 11:53:18,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,498 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:53:18,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:18,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,502 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 [2018-11-28 11:53:18,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:18,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:18,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,507 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 [2018-11-28 11:53:18,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,510 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 [2018-11-28 11:53:18,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:18,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:18,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,514 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 [2018-11-28 11:53:18,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,516 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 [2018-11-28 11:53:18,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,518 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 [2018-11-28 11:53:18,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,520 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 [2018-11-28 11:53:18,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,522 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 [2018-11-28 11:53:18,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:18,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:18,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,526 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 [2018-11-28 11:53:18,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,527 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 [2018-11-28 11:53:18,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:18,530 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 [2018-11-28 11:53:18,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:18,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:18,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:18,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:18,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:18,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:18,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:18,533 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:53:18,535 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:53:18,535 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 11:53:18,537 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:53:18,537 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:53:18,537 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:53:18,538 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2018-11-28 11:53:18,539 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:53:18,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:18,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:18,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:18,675 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 [2018-11-28 11:53:18,675 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137 states and 192 transitions. cyclomatic complexity: 56 Second operand 3 states. [2018-11-28 11:53:18,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137 states and 192 transitions. cyclomatic complexity: 56. Second operand 3 states. Result 229 states and 340 transitions. Complement of second has 4 states. [2018-11-28 11:53:18,732 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 [2018-11-28 11:53:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:53:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2018-11-28 11:53:18,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 192 transitions. Stem has 45 letters. Loop has 31 letters. [2018-11-28 11:53:18,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:18,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 192 transitions. Stem has 76 letters. Loop has 31 letters. [2018-11-28 11:53:18,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:18,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 192 transitions. Stem has 45 letters. Loop has 62 letters. [2018-11-28 11:53:18,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:18,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 340 transitions. [2018-11-28 11:53:18,742 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:53:18,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 0 states and 0 transitions. [2018-11-28 11:53:18,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:53:18,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:53:18,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:53:18,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:18,743 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:18,743 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:18,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:53:18,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:53:18,743 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-28 11:53:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:18,744 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 11:53:18,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:53:18,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 11:53:18,744 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:53:18,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:53:18,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:53:18,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:53:18,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:53:18,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:18,744 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:18,745 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:18,745 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:18,745 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:53:18,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:53:18,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:53:18,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:53:18,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:53:18 BoogieIcfgContainer [2018-11-28 11:53:18,750 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:53:18,751 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:53:18,751 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:53:18,751 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:53:18,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:53:15" (3/4) ... [2018-11-28 11:53:18,754 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:53:18,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:53:18,755 INFO L168 Benchmark]: Toolchain (without parser) took 4379.55 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 156.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:18,756 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:53:18,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:18,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.27 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:18,757 INFO L168 Benchmark]: Boogie Preprocessor took 32.78 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. [2018-11-28 11:53:18,757 INFO L168 Benchmark]: RCFGBuilder took 567.51 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:18,758 INFO L168 Benchmark]: BuchiAutomizer took 3453.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -55.2 MB). Peak memory consumption was 131.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:18,758 INFO L168 Benchmark]: Witness Printer took 3.64 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 11:53:18,763 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.27 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.78 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 567.51 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3453.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -55.2 MB). Peak memory consumption was 131.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.64 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 137 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 621 SDtfs, 339 SDslu, 1148 SDs, 0 SdLazy, 22 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax121 hnf105 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...