./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/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 bface9c2aaf995719ea2868f2c86b44f41c1d67a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:54:42,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:54:42,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:54:43,001 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:54:43,001 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:54:43,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:54:43,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:54:43,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:54:43,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:54:43,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:54:43,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:54:43,006 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:54:43,007 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:54:43,008 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:54:43,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:54:43,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:54:43,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:54:43,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:54:43,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:54:43,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:54:43,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:54:43,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:54:43,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:54:43,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:54:43,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:54:43,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:54:43,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:54:43,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:54:43,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:54:43,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:54:43,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:54:43,022 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:54:43,022 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:54:43,023 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:54:43,023 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:54:43,024 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:54:43,024 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 15:54:43,034 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:54:43,034 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:54:43,035 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:54:43,035 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:54:43,036 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:54:43,036 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:54:43,036 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:54:43,036 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:54:43,037 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:54:43,037 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:54:43,037 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:54:43,037 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:54:43,037 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:54:43,037 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:54:43,037 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:54:43,037 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:54:43,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:54:43,038 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:54:43,038 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:54:43,038 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:54:43,038 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:54:43,038 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:54:43,038 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:54:43,038 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:54:43,039 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:54:43,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:54:43,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:54:43,039 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:54:43,039 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:54:43,039 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:54:43,039 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:54:43,040 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:54:43,040 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_ccfddd32-b188-48e1-9251-8a2681af8f8c/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 -> bface9c2aaf995719ea2868f2c86b44f41c1d67a [2018-11-23 15:54:43,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:54:43,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:54:43,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:54:43,074 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:54:43,075 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:54:43,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2018-11-23 15:54:43,111 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/data/41d902189/924888a89e4640a28b09cdc1a884011e/FLAGa0e48b9ff [2018-11-23 15:54:43,556 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:54:43,557 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2018-11-23 15:54:43,565 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/data/41d902189/924888a89e4640a28b09cdc1a884011e/FLAGa0e48b9ff [2018-11-23 15:54:43,576 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/bin-2019/uautomizer/data/41d902189/924888a89e4640a28b09cdc1a884011e [2018-11-23 15:54:43,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:54:43,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:54:43,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:54:43,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:54:43,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:54:43,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f66bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43, skipping insertion in model container [2018-11-23 15:54:43,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:54:43,623 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:54:43,774 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:54:43,779 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:54:43,816 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:54:43,873 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:54:43,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43 WrapperNode [2018-11-23 15:54:43,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:54:43,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:54:43,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:54:43,875 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:54:43,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:54:43,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:54:43,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:54:43,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:54:43,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... [2018-11-23 15:54:43,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:54:43,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:54:43,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:54:43,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:54:43,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/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-23 15:54:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:54:43,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:54:44,365 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:54:44,365 INFO L280 CfgBuilder]: Removed 23 assue(true) statements. [2018-11-23 15:54:44,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:54:44 BoogieIcfgContainer [2018-11-23 15:54:44,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:54:44,366 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:54:44,366 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:54:44,368 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:54:44,368 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:54:44,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:54:43" (1/3) ... [2018-11-23 15:54:44,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d5a4bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:54:44, skipping insertion in model container [2018-11-23 15:54:44,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:54:44,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:54:43" (2/3) ... [2018-11-23 15:54:44,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d5a4bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:54:44, skipping insertion in model container [2018-11-23 15:54:44,370 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:54:44,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:54:44" (3/3) ... [2018-11-23 15:54:44,371 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2018-11-23 15:54:44,403 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:54:44,404 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:54:44,404 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:54:44,404 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:54:44,404 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:54:44,404 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:54:44,404 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:54:44,404 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:54:44,404 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:54:44,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2018-11-23 15:54:44,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-23 15:54:44,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:54:44,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:54:44,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:54:44,442 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-23 15:54:44,443 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:54:44,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2018-11-23 15:54:44,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-23 15:54:44,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:54:44,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:54:44,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:54:44,449 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-23 15:54:44,456 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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]; 9#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 88#L272true assume !(0 == ~r1~0);init_~tmp~0 := 0; 86#L272-1true init_#res := init_~tmp~0; 39#L433true main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; 102#L511-2true [2018-11-23 15:54:44,456 INFO L796 eck$LassoCheckResult]: Loop: 102#L511-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 15#L120true assume !(0 != ~mode1~0 % 256); 97#L134true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 109#L134-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 14#L120-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 62#L146true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 64#L149true assume !(node2_~m2~0 != ~nomsg~0); 49#L149-1true ~mode2~0 := 0; 59#L146-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 66#L171true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 55#L174true assume !(node3_~m3~0 != ~nomsg~0); 54#L174-1true ~mode3~0 := 0; 48#L171-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 56#L196true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 32#L199true assume !(node4_~m4~0 != ~nomsg~0); 30#L199-1true ~mode4~0 := 0; 53#L196-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 33#L221true assume !(0 != ~mode5~0 % 256); 81#L234true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 63#L234-2true ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 29#L221-2true havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 37#L246true assume !(0 != ~mode6~0 % 256); 70#L259true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 67#L259-2true ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 23#L246-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; 42#L441true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 43#L441-1true check_#res := check_~tmp~1; 20#L461true main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 8#L544true assume !(0 == assert_~arg % 256); 95#L539true main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 102#L511-2true [2018-11-23 15:54:44,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:44,461 INFO L82 PathProgramCache]: Analyzing trace with hash 28928112, now seen corresponding path program 1 times [2018-11-23 15:54:44,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:54:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:54:44,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:44,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:44,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:54:44,607 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-23 15:54:44,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:54:44,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:54:44,612 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:54:44,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash 15305473, now seen corresponding path program 1 times [2018-11-23 15:54:44,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:54:44,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:54:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:44,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:54:44,702 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-23 15:54:44,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:54:44,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:54:44,704 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:54:44,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:54:44,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:54:44,715 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2018-11-23 15:54:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:54:44,798 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2018-11-23 15:54:44,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:54:44,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 183 transitions. [2018-11-23 15:54:44,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-11-23 15:54:44,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 102 states and 137 transitions. [2018-11-23 15:54:44,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-23 15:54:44,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-11-23 15:54:44,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 137 transitions. [2018-11-23 15:54:44,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:54:44,809 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-11-23 15:54:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 137 transitions. [2018-11-23 15:54:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-23 15:54:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 15:54:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2018-11-23 15:54:44,837 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-11-23 15:54:44,837 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-11-23 15:54:44,837 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:54:44,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 137 transitions. [2018-11-23 15:54:44,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-11-23 15:54:44,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:54:44,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:54:44,840 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] [2018-11-23 15:54:44,840 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-23 15:54:44,841 INFO L794 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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]; 244#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 245#L272 assume 0 == ~r1~0; 303#L273 assume ~id1~0 >= 0; 234#L274 assume 0 == ~st1~0; 235#L275 assume ~send1~0 == ~id1~0; 291#L276 assume 0 == ~mode1~0 % 256; 246#L277 assume ~id2~0 >= 0; 247#L278 assume 0 == ~st2~0; 295#L279 assume ~send2~0 == ~id2~0; 296#L280 assume 0 == ~mode2~0 % 256; 322#L281 assume ~id3~0 >= 0; 264#L282 assume 0 == ~st3~0; 265#L283 assume ~send3~0 == ~id3~0; 304#L284 assume 0 == ~mode3~0 % 256; 236#L285 assume ~id4~0 >= 0; 237#L286 assume 0 == ~st4~0; 310#L287 assume ~send4~0 == ~id4~0; 248#L288 assume 0 == ~mode4~0 % 256; 249#L289 assume ~id5~0 >= 0; 297#L290 assume 0 == ~st5~0; 298#L291 assume ~send5~0 == ~id5~0; 323#L292 assume 0 == ~mode5~0 % 256; 266#L293 assume ~id6~0 >= 0; 267#L294 assume 0 == ~st6~0; 305#L295 assume ~send6~0 == ~id6~0; 240#L296 assume 0 == ~mode6~0 % 256; 241#L297 assume ~id1~0 != ~id2~0; 311#L298 assume ~id1~0 != ~id3~0; 252#L299 assume ~id1~0 != ~id4~0; 253#L300 assume ~id1~0 != ~id5~0; 301#L301 assume ~id1~0 != ~id6~0; 302#L302 assume ~id2~0 != ~id3~0; 315#L303 assume ~id2~0 != ~id4~0; 278#L304 assume ~id2~0 != ~id5~0; 279#L305 assume ~id2~0 != ~id6~0; 312#L306 assume ~id3~0 != ~id4~0; 250#L307 assume ~id3~0 != ~id5~0; 251#L308 assume ~id3~0 != ~id6~0; 306#L309 assume ~id4~0 != ~id5~0; 238#L310 assume ~id4~0 != ~id6~0; 239#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 325#L272-1 init_#res := init_~tmp~0; 299#L433 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; 300#L511-2 [2018-11-23 15:54:44,841 INFO L796 eck$LassoCheckResult]: Loop: 300#L511-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 256#L120 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; 257#L124 assume !(node1_~m1~0 != ~nomsg~0); 272#L124-1 ~mode1~0 := 0; 254#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 255#L146 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 317#L149 assume !(node2_~m2~0 != ~nomsg~0); 260#L149-1 ~mode2~0 := 0; 309#L146-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 316#L171 assume !(0 != ~mode3~0 % 256); 320#L184 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 329#L184-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 307#L171-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 308#L196 assume !(0 != ~mode4~0 % 256); 314#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 324#L209-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 285#L196-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 288#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 289#L224 assume !(node5_~m5~0 != ~nomsg~0); 292#L224-1 ~mode5~0 := 0; 282#L221-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 283#L246 assume !(0 != ~mode6~0 % 256); 294#L259 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 321#L259-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 274#L246-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; 275#L441 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 270#L441-1 check_#res := check_~tmp~1; 268#L461 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 242#L544 assume !(0 == assert_~arg % 256); 243#L539 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 300#L511-2 [2018-11-23 15:54:44,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:44,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 1 times [2018-11-23 15:54:44,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:54:44,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:54:44,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:44,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:44,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:54:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:54:44,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1179596289, now seen corresponding path program 1 times [2018-11-23 15:54:44,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:54:44,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:54:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:44,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:54:44,982 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-23 15:54:44,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:54:44,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:54:44,982 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:54:44,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:54:44,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:54:44,983 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. cyclomatic complexity: 36 Second operand 5 states. [2018-11-23 15:54:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:54:45,022 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2018-11-23 15:54:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:54:45,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 139 transitions. [2018-11-23 15:54:45,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-11-23 15:54:45,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 102 states and 134 transitions. [2018-11-23 15:54:45,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-23 15:54:45,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-11-23 15:54:45,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 134 transitions. [2018-11-23 15:54:45,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:54:45,026 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2018-11-23 15:54:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 134 transitions. [2018-11-23 15:54:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-23 15:54:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 15:54:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2018-11-23 15:54:45,032 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2018-11-23 15:54:45,032 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2018-11-23 15:54:45,032 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:54:45,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 134 transitions. [2018-11-23 15:54:45,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-11-23 15:54:45,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:54:45,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:54:45,035 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] [2018-11-23 15:54:45,035 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, 1] [2018-11-23 15:54:45,035 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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]; 463#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 464#L272 assume 0 == ~r1~0; 522#L273 assume ~id1~0 >= 0; 453#L274 assume 0 == ~st1~0; 454#L275 assume ~send1~0 == ~id1~0; 510#L276 assume 0 == ~mode1~0 % 256; 465#L277 assume ~id2~0 >= 0; 466#L278 assume 0 == ~st2~0; 514#L279 assume ~send2~0 == ~id2~0; 515#L280 assume 0 == ~mode2~0 % 256; 541#L281 assume ~id3~0 >= 0; 483#L282 assume 0 == ~st3~0; 484#L283 assume ~send3~0 == ~id3~0; 523#L284 assume 0 == ~mode3~0 % 256; 455#L285 assume ~id4~0 >= 0; 456#L286 assume 0 == ~st4~0; 529#L287 assume ~send4~0 == ~id4~0; 467#L288 assume 0 == ~mode4~0 % 256; 468#L289 assume ~id5~0 >= 0; 516#L290 assume 0 == ~st5~0; 517#L291 assume ~send5~0 == ~id5~0; 542#L292 assume 0 == ~mode5~0 % 256; 485#L293 assume ~id6~0 >= 0; 486#L294 assume 0 == ~st6~0; 524#L295 assume ~send6~0 == ~id6~0; 459#L296 assume 0 == ~mode6~0 % 256; 460#L297 assume ~id1~0 != ~id2~0; 530#L298 assume ~id1~0 != ~id3~0; 471#L299 assume ~id1~0 != ~id4~0; 472#L300 assume ~id1~0 != ~id5~0; 520#L301 assume ~id1~0 != ~id6~0; 521#L302 assume ~id2~0 != ~id3~0; 534#L303 assume ~id2~0 != ~id4~0; 497#L304 assume ~id2~0 != ~id5~0; 498#L305 assume ~id2~0 != ~id6~0; 531#L306 assume ~id3~0 != ~id4~0; 469#L307 assume ~id3~0 != ~id5~0; 470#L308 assume ~id3~0 != ~id6~0; 525#L309 assume ~id4~0 != ~id5~0; 457#L310 assume ~id4~0 != ~id6~0; 458#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 544#L272-1 init_#res := init_~tmp~0; 518#L433 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; 519#L511-2 [2018-11-23 15:54:45,035 INFO L796 eck$LassoCheckResult]: Loop: 519#L511-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 475#L120 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; 476#L124 assume !(node1_~m1~0 != ~nomsg~0); 491#L124-1 ~mode1~0 := 0; 473#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 474#L146 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 536#L149 assume !(node2_~m2~0 != ~nomsg~0); 479#L149-1 ~mode2~0 := 0; 528#L146-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 535#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 532#L174 assume !(node3_~m3~0 != ~nomsg~0); 451#L174-1 ~mode3~0 := 0; 526#L171-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 527#L196 assume !(0 != ~mode4~0 % 256); 533#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 543#L209-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 504#L196-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 507#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 508#L224 assume !(node5_~m5~0 != ~nomsg~0); 511#L224-1 ~mode5~0 := 0; 501#L221-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 502#L246 assume !(0 != ~mode6~0 % 256); 513#L259 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 540#L259-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 493#L246-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; 494#L441 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 480#L442 assume ~r1~0 >= 6; 481#L446 assume ~r1~0 < 6;check_~tmp~1 := 1; 489#L441-1 check_#res := check_~tmp~1; 487#L461 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 461#L544 assume !(0 == assert_~arg % 256); 462#L539 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 519#L511-2 [2018-11-23 15:54:45,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:45,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 2 times [2018-11-23 15:54:45,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:54:45,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:54:45,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:45,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:54:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:54:45,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1341300421, now seen corresponding path program 1 times [2018-11-23 15:54:45,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:54:45,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:54:45,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:54:45,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:54:45,107 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-23 15:54:45,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:54:45,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:54:45,108 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:54:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:54:45,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:54:45,108 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. cyclomatic complexity: 33 Second operand 3 states. [2018-11-23 15:54:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:54:45,151 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2018-11-23 15:54:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:54:45,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 213 transitions. [2018-11-23 15:54:45,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2018-11-23 15:54:45,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 213 transitions. [2018-11-23 15:54:45,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-23 15:54:45,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-23 15:54:45,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 213 transitions. [2018-11-23 15:54:45,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:54:45,156 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2018-11-23 15:54:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 213 transitions. [2018-11-23 15:54:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-11-23 15:54:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 15:54:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2018-11-23 15:54:45,163 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2018-11-23 15:54:45,163 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2018-11-23 15:54:45,163 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:54:45,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 213 transitions. [2018-11-23 15:54:45,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2018-11-23 15:54:45,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:54:45,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:54:45,166 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] [2018-11-23 15:54:45,166 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, 1, 1] [2018-11-23 15:54:45,166 INFO L794 eck$LassoCheckResult]: Stem: 808#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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]; 725#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 726#L272 assume 0 == ~r1~0; 783#L273 assume ~id1~0 >= 0; 715#L274 assume 0 == ~st1~0; 716#L275 assume ~send1~0 == ~id1~0; 771#L276 assume 0 == ~mode1~0 % 256; 727#L277 assume ~id2~0 >= 0; 728#L278 assume 0 == ~st2~0; 775#L279 assume ~send2~0 == ~id2~0; 776#L280 assume 0 == ~mode2~0 % 256; 803#L281 assume ~id3~0 >= 0; 744#L282 assume 0 == ~st3~0; 745#L283 assume ~send3~0 == ~id3~0; 784#L284 assume 0 == ~mode3~0 % 256; 717#L285 assume ~id4~0 >= 0; 718#L286 assume 0 == ~st4~0; 790#L287 assume ~send4~0 == ~id4~0; 729#L288 assume 0 == ~mode4~0 % 256; 730#L289 assume ~id5~0 >= 0; 777#L290 assume 0 == ~st5~0; 778#L291 assume ~send5~0 == ~id5~0; 804#L292 assume 0 == ~mode5~0 % 256; 746#L293 assume ~id6~0 >= 0; 747#L294 assume 0 == ~st6~0; 785#L295 assume ~send6~0 == ~id6~0; 721#L296 assume 0 == ~mode6~0 % 256; 722#L297 assume ~id1~0 != ~id2~0; 791#L298 assume ~id1~0 != ~id3~0; 733#L299 assume ~id1~0 != ~id4~0; 734#L300 assume ~id1~0 != ~id5~0; 781#L301 assume ~id1~0 != ~id6~0; 782#L302 assume ~id2~0 != ~id3~0; 795#L303 assume ~id2~0 != ~id4~0; 758#L304 assume ~id2~0 != ~id5~0; 759#L305 assume ~id2~0 != ~id6~0; 792#L306 assume ~id3~0 != ~id4~0; 731#L307 assume ~id3~0 != ~id5~0; 732#L308 assume ~id3~0 != ~id6~0; 786#L309 assume ~id4~0 != ~id5~0; 719#L310 assume ~id4~0 != ~id6~0; 720#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 806#L272-1 init_#res := init_~tmp~0; 779#L433 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; 780#L511-2 [2018-11-23 15:54:45,166 INFO L796 eck$LassoCheckResult]: Loop: 780#L511-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 861#L120 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; 738#L124 assume !(node1_~m1~0 != ~nomsg~0); 752#L124-1 ~mode1~0 := 0; 797#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 858#L146 assume !(0 != ~mode2~0 % 256); 854#L159 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 853#L159-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 851#L146-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 850#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 848#L174 assume !(node3_~m3~0 != ~nomsg~0); 844#L174-1 ~mode3~0 := 0; 843#L171-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 842#L196 assume !(0 != ~mode4~0 % 256); 838#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 837#L209-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 835#L196-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 834#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 832#L224 assume !(node5_~m5~0 != ~nomsg~0); 829#L224-1 ~mode5~0 := 0; 827#L221-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 826#L246 assume !(0 != ~mode6~0 % 256); 822#L259 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 820#L259-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 819#L246-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; 818#L441 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 817#L442 assume !(~r1~0 >= 6); 815#L445 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 816#L446 assume ~r1~0 < 6;check_~tmp~1 := 1; 865#L441-1 check_#res := check_~tmp~1; 864#L461 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 863#L544 assume !(0 == assert_~arg % 256); 862#L539 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 780#L511-2 [2018-11-23 15:54:45,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 3 times [2018-11-23 15:54:45,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:54:45,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:54:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:54:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:54:45,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash 636710160, now seen corresponding path program 1 times [2018-11-23 15:54:45,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:54:45,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:54:45,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:54:45,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:54:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:54:45,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1784458480, now seen corresponding path program 1 times [2018-11-23 15:54:45,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:54:45,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:54:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:54:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:54:45,291 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-23 15:54:45,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:54:45,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:54:45,682 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 173 [2018-11-23 15:54:49,485 WARN L180 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 186 DAG size of output: 167 [2018-11-23 15:54:49,494 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:54:49,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:54:49,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:54:49,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:54:49,496 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 15:54:49,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:54:49,496 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:54:49,496 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:54:49,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2018-11-23 15:54:49,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:54:49,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:54:49,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-23 15:54:49,657 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 15788 disjunctions. This might take some time... [2018-11-23 15:54:50,143 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 60 disjunctions. [2018-11-23 15:54:50,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-23 15:54:50,155 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-23 15:54:50,157 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-23 15:54:50,158 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-23 15:54:50,159 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-23 15:54:50,160 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-23 15:54:50,315 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2018-11-23 15:54:50,315 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-23 15:54:50,333 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-23 15:54:50,336 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-23 15:54:50,338 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-23 15:54:50,339 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-23 15:54:50,340 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-23 15:54:50,342 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-23 15:54:50,344 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-23 15:54:50,346 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-23 15:54:50,348 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-23 15:54:50,349 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-23 15:54:50,352 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-23 15:54:50,355 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-23 15:54:50,356 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-23 15:54:50,358 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-23 15:54:50,360 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-23 15:54:50,361 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-23 15:54:50,363 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-23 15:54:50,363 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-23 15:54:50,366 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-23 15:54:50,371 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-23 15:54:50,372 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-23 15:54:50,375 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-23 15:54:50,379 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-23 15:54:50,382 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-23 15:54:50,383 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-23 15:54:50,623 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2018-11-23 15:54:50,731 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 15:55:19,680 WARN L180 SmtUtils]: Spent 28.85 s on a formula simplification. DAG size of input: 647 DAG size of output: 199 [2018-11-23 15:55:19,847 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:55:19,848 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/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-23 15:55:19,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 15:55:19,853 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccfddd32-b188-48e1-9251-8a2681af8f8c/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-23 15:55:19,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 15:55:19,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 15:55:20,040 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 15:55:20,042 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:55:20,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:55:20,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:55:20,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:55:20,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:55:20,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:55:20,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:55:20,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:55:20,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2018-11-23 15:55:20,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:55:20,043 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:55:20,046 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-23 15:55:20,111 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 15788 disjunctions. This might take some time... [2018-11-23 15:55:20,648 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 60 disjunctions. [2018-11-23 15:55:20,649 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-23 15:55:20,661 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-23 15:55:20,662 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-23 15:55:20,665 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-23 15:55:20,811 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2018-11-23 15:55:20,811 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-23 15:55:20,812 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-23 15:55:20,813 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-23 15:55:20,814 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-23 15:55:20,832 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-23 15:55:20,833 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-23 15:55:20,836 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-23 15:55:20,838 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-23 15:55:20,839 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-23 15:55:20,842 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-23 15:55:20,843 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-23 15:55:20,844 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-23 15:55:20,846 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-23 15:55:20,848 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-23 15:55:20,849 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-23 15:55:20,851 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-23 15:55:20,853 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-23 15:55:20,854 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-23 15:55:20,857 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-23 15:55:20,858 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-23 15:55:20,861 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-23 15:55:20,862 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-23 15:55:20,863 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-23 15:55:20,865 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-23 15:55:20,867 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-23 15:55:20,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-23 15:55:20,873 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-23 15:55:20,874 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-23 15:55:21,078 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2018-11-23 15:55:21,178 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 15:55:50,566 WARN L180 SmtUtils]: Spent 29.30 s on a formula simplification. DAG size of input: 647 DAG size of output: 199 [2018-11-23 15:55:50,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:55:50,687 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:55:50,689 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-23 15:55:50,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:50,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:50,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:50,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:50,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:50,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:55:50,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:50,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:50,697 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-23 15:55:50,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:50,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:50,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:50,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:50,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:50,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:55:50,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:50,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:50,699 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-23 15:55:50,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:50,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:50,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:50,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:50,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:55:50,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:55:50,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:50,708 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-23 15:55:50,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:50,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:50,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:50,711 INFO L206 nArgumentSynthesizer]: 64 loop disjuncts [2018-11-23 15:55:50,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:50,850 INFO L402 nArgumentSynthesizer]: We have 128 Motzkin's Theorem applications. [2018-11-23 15:55:50,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:51,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,321 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-23 15:55:51,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:51,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:55:51,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:51,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,323 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-23 15:55:51,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:51,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:55:51,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:51,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,324 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-23 15:55:51,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:51,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:55:51,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:51,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,326 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-23 15:55:51,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:51,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,327 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:55:51,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,327 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:55:51,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:51,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,330 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-23 15:55:51,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:55:51,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:55:51,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,333 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-23 15:55:51,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:51,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:55:51,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:51,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,335 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-23 15:55:51,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:55:51,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:55:51,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,338 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-23 15:55:51,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:55:51,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:55:51,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,341 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-23 15:55:51,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:51,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:55:51,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:51,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,343 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-23 15:55:51,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:51,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:55:51,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:51,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,345 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-23 15:55:51,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:55:51,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:55:51,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:55:51,348 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-23 15:55:51,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:55:51,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:55:51,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:55:51,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:55:51,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:55:51,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:55:51,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:55:51,350 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:55:51,352 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:55:51,352 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 15:55:51,354 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:55:51,354 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 15:55:51,354 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:55:51,355 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-23 15:55:51,356 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 15:55:51,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:55:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:55:51,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:55:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:55:51,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:55:51,473 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-23 15:55:51,476 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-23 15:55:51,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60 Second operand 3 states. [2018-11-23 15:55:51,517 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60. Second operand 3 states. Result 263 states and 382 transitions. Complement of second has 4 states. [2018-11-23 15:55:51,518 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-23 15:55:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:55:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 15:55:51,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 33 letters. [2018-11-23 15:55:51,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:55:51,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 77 letters. Loop has 33 letters. [2018-11-23 15:55:51,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:55:51,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 66 letters. [2018-11-23 15:55:51,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:55:51,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 382 transitions. [2018-11-23 15:55:51,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:55:51,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 0 states and 0 transitions. [2018-11-23 15:55:51,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:55:51,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:55:51,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:55:51,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:55:51,528 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:55:51,528 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:55:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:55:51,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:55:51,529 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-23 15:55:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:55:51,529 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 15:55:51,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:55:51,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-23 15:55:51,529 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:55:51,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 15:55:51,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:55:51,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:55:51,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:55:51,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:55:51,530 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:55:51,530 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:55:51,530 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:55:51,530 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:55:51,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:55:51,530 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:55:51,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:55:51,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:55:51 BoogieIcfgContainer [2018-11-23 15:55:51,536 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:55:51,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:55:51,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:55:51,536 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:55:51,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:54:44" (3/4) ... [2018-11-23 15:55:51,540 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:55:51,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:55:51,540 INFO L168 Benchmark]: Toolchain (without parser) took 67961.41 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 438.8 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 263.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:51,541 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:55:51,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:51,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:51,542 INFO L168 Benchmark]: Boogie Preprocessor took 19.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:55:51,542 INFO L168 Benchmark]: RCFGBuilder took 443.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:51,543 INFO L168 Benchmark]: BuchiAutomizer took 67169.98 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 341.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -92.2 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:51,543 INFO L168 Benchmark]: Witness Printer took 3.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:55:51,546 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 443.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 67169.98 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 341.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -92.2 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 67.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 66.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 154 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 653 SDtfs, 213 SDslu, 929 SDs, 0 SdLazy, 32 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital3298 mio100 ax102 hnf100 lsp6 ukn67 mio100 lsp100 div166 bol100 ite100 ukn100 eq170 hnf68 smp100 dnf40960 smp12 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 611ms VariablesStem: 0 VariablesLoop: 37 DisjunctsStem: 1 DisjunctsLoop: 64 SupportingInvariants: 0 MotzkinApplications: 128 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...