./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.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_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/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 5ece07e091f918f26c76e2a65f38501df262220c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:21:36,913 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:21:36,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:21:36,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:21:36,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:21:36,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:21:36,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:21:36,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:21:36,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:21:36,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:21:36,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:21:36,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:21:36,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:21:36,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:21:36,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:21:36,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:21:36,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:21:36,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:21:36,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:21:36,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:21:36,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:21:36,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:21:36,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:21:36,934 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:21:36,934 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:21:36,935 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:21:36,935 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:21:36,936 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:21:36,936 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:21:36,937 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:21:36,937 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:21:36,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:21:36,937 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:21:36,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:21:36,938 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:21:36,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:21:36,938 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 13:21:36,949 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:21:36,949 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:21:36,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:21:36,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:21:36,950 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:21:36,950 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:21:36,950 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:21:36,950 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:21:36,951 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:21:36,951 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:21:36,951 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:21:36,951 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:21:36,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:21:36,951 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:21:36,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:21:36,951 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:21:36,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:21:36,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:21:36,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:21:36,952 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:21:36,952 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:21:36,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:21:36,952 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:21:36,953 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:21:36,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:21:36,953 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:21:36,953 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:21:36,953 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:21:36,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:21:36,953 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:21:36,953 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:21:36,954 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:21:36,954 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_4fd37442-0c0e-4a48-bd98-1379d72070be/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 -> 5ece07e091f918f26c76e2a65f38501df262220c [2018-11-23 13:21:36,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:21:36,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:21:36,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:21:36,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:21:36,989 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:21:36,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-23 13:21:37,030 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/data/f34269abf/8b6d15e7551148efac824166269c40fa/FLAGb914843f0 [2018-11-23 13:21:37,464 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:21:37,464 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-23 13:21:37,471 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/data/f34269abf/8b6d15e7551148efac824166269c40fa/FLAGb914843f0 [2018-11-23 13:21:37,480 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/bin-2019/uautomizer/data/f34269abf/8b6d15e7551148efac824166269c40fa [2018-11-23 13:21:37,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:21:37,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:21:37,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:21:37,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:21:37,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:21:37,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658711a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37, skipping insertion in model container [2018-11-23 13:21:37,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:21:37,518 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:21:37,668 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:21:37,674 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:21:37,707 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:21:37,758 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:21:37,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37 WrapperNode [2018-11-23 13:21:37,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:21:37,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:21:37,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:21:37,759 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:21:37,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:21:37,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:21:37,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:21:37,790 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:21:37,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... [2018-11-23 13:21:37,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:21:37,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:21:37,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:21:37,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:21:37,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/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 13:21:37,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:21:37,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:21:38,246 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:21:38,246 INFO L280 CfgBuilder]: Removed 19 assue(true) statements. [2018-11-23 13:21:38,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:38 BoogieIcfgContainer [2018-11-23 13:21:38,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:21:38,247 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:21:38,247 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:21:38,249 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:21:38,250 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:21:38,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:21:37" (1/3) ... [2018-11-23 13:21:38,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b28ab85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:21:38, skipping insertion in model container [2018-11-23 13:21:38,251 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:21:38,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:37" (2/3) ... [2018-11-23 13:21:38,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b28ab85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:21:38, skipping insertion in model container [2018-11-23 13:21:38,251 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:21:38,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:38" (3/3) ... [2018-11-23 13:21:38,253 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-23 13:21:38,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:21:38,288 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:21:38,288 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:21:38,288 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:21:38,288 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:21:38,288 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:21:38,288 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:21:38,288 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:21:38,288 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:21:38,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states. [2018-11-23 13:21:38,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-23 13:21:38,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:21:38,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:21:38,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:21:38,327 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] [2018-11-23 13:21:38,327 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:21:38,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states. [2018-11-23 13:21:38,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-23 13:21:38,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:21:38,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:21:38,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:21:38,332 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] [2018-11-23 13:21:38,337 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~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;~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]; 11#L-1true havoc main_#res;havoc 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 82#L244true assume !(0 == ~r1~0);init_~tmp~0 := 0; 80#L244-1true init_#res := init_~tmp~0; 58#L341true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 44#L403-2true [2018-11-23 13:21:38,338 INFO L796 eck$LassoCheckResult]: Loop: 44#L403-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 49#L110true assume !(0 != ~mode1~0 % 256); 38#L128true assume !(0 != ~alive1~0 % 256); 10#L128-2true ~mode1~0 := 1; 43#L110-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 23#L142true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 78#L145true assume !(node2_~m2~0 != ~nomsg~0); 75#L145-1true ~mode2~0 := 0; 16#L142-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 26#L176true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 9#L179true assume !(node3_~m3~0 != ~nomsg~0); 8#L179-1true ~mode3~0 := 0; 50#L176-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 56#L210true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 62#L213true assume !(node4_~m4~0 != ~nomsg~0); 34#L213-1true ~mode4~0 := 0; 55#L210-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 65#L349true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 68#L349-1true check_#res := check_~tmp~1; 85#L361true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 74#L430true assume !(0 == assert_~arg % 256); 35#L425true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 44#L403-2true [2018-11-23 13:21:38,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:21:38,343 INFO L82 PathProgramCache]: Analyzing trace with hash 28832784, now seen corresponding path program 1 times [2018-11-23 13:21:38,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:21:38,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:21:38,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:21:38,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:21:38,457 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 13:21:38,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:21:38,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:21:38,462 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:21:38,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:21:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1227957475, now seen corresponding path program 1 times [2018-11-23 13:21:38,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:21:38,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:21:38,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:21:38,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:21:38,525 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 13:21:38,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:21:38,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:21:38,526 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:21:38,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:21:38,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:21:38,536 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 4 states. [2018-11-23 13:21:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:21:38,597 INFO L93 Difference]: Finished difference Result 96 states and 156 transitions. [2018-11-23 13:21:38,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:21:38,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 156 transitions. [2018-11-23 13:21:38,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-23 13:21:38,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 89 states and 126 transitions. [2018-11-23 13:21:38,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-23 13:21:38,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2018-11-23 13:21:38,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 126 transitions. [2018-11-23 13:21:38,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:21:38,608 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 126 transitions. [2018-11-23 13:21:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 126 transitions. [2018-11-23 13:21:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-23 13:21:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 13:21:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2018-11-23 13:21:38,630 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 126 transitions. [2018-11-23 13:21:38,630 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 126 transitions. [2018-11-23 13:21:38,630 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:21:38,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 126 transitions. [2018-11-23 13:21:38,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-23 13:21:38,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:21:38,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:21:38,632 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] [2018-11-23 13:21:38,632 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] [2018-11-23 13:21:38,633 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~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;~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]; 223#L-1 havoc main_#res;havoc 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 224#L244 assume 0 == ~r1~0; 258#L245 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 259#L246 assume ~id1~0 >= 0; 283#L247 assume 0 == ~st1~0; 239#L248 assume ~send1~0 == ~id1~0; 240#L249 assume 0 == ~mode1~0 % 256; 270#L250 assume ~id2~0 >= 0; 272#L251 assume 0 == ~st2~0; 210#L252 assume ~send2~0 == ~id2~0; 211#L253 assume 0 == ~mode2~0 % 256; 252#L254 assume ~id3~0 >= 0; 225#L255 assume 0 == ~st3~0; 226#L256 assume ~send3~0 == ~id3~0; 264#L257 assume 0 == ~mode3~0 % 256; 284#L258 assume ~id4~0 >= 0; 241#L259 assume 0 == ~st4~0; 242#L260 assume ~send4~0 == ~id4~0; 271#L261 assume 0 == ~mode4~0 % 256; 273#L262 assume ~id1~0 != ~id2~0; 212#L263 assume ~id1~0 != ~id3~0; 213#L264 assume ~id1~0 != ~id4~0; 253#L265 assume ~id2~0 != ~id3~0; 227#L266 assume ~id2~0 != ~id4~0; 228#L267 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 265#L244-1 init_#res := init_~tmp~0; 277#L341 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 257#L403-2 [2018-11-23 13:21:38,633 INFO L796 eck$LassoCheckResult]: Loop: 257#L403-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 266#L110 assume !(0 != ~mode1~0 % 256); 260#L128 assume !(0 != ~alive1~0 % 256); 221#L128-2 ~mode1~0 := 1; 222#L110-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 244#L142 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 246#L145 assume !(node2_~m2~0 != ~nomsg~0); 215#L145-1 ~mode2~0 := 0; 234#L142-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 235#L176 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 219#L179 assume !(node3_~m3~0 != ~nomsg~0); 217#L179-1 ~mode3~0 := 0; 218#L176-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 269#L210 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 275#L213 assume !(node4_~m4~0 != ~nomsg~0); 237#L213-1 ~mode4~0 := 0; 247#L210-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 274#L349 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 281#L349-1 check_#res := check_~tmp~1; 285#L361 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 290#L430 assume !(0 == assert_~arg % 256); 256#L425 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 257#L403-2 [2018-11-23 13:21:38,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:21:38,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 1 times [2018-11-23 13:21:38,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:21:38,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:21:38,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:21:38,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:21:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:21:38,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:21:38,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1227957475, now seen corresponding path program 2 times [2018-11-23 13:21:38,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:21:38,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:21:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:21:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:21:38,759 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 13:21:38,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:21:38,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:21:38,760 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:21:38,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:21:38,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:21:38,761 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. cyclomatic complexity: 38 Second operand 5 states. [2018-11-23 13:21:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:21:38,786 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2018-11-23 13:21:38,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:21:38,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 128 transitions. [2018-11-23 13:21:38,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-23 13:21:38,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 124 transitions. [2018-11-23 13:21:38,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-23 13:21:38,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2018-11-23 13:21:38,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 124 transitions. [2018-11-23 13:21:38,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:21:38,789 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 124 transitions. [2018-11-23 13:21:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 124 transitions. [2018-11-23 13:21:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-23 13:21:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 13:21:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2018-11-23 13:21:38,791 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 124 transitions. [2018-11-23 13:21:38,791 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 124 transitions. [2018-11-23 13:21:38,791 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:21:38,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 124 transitions. [2018-11-23 13:21:38,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-23 13:21:38,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:21:38,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:21:38,796 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] [2018-11-23 13:21:38,796 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] [2018-11-23 13:21:38,797 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~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;~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]; 416#L-1 havoc main_#res;havoc 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 417#L244 assume 0 == ~r1~0; 451#L245 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 452#L246 assume ~id1~0 >= 0; 474#L247 assume 0 == ~st1~0; 432#L248 assume ~send1~0 == ~id1~0; 433#L249 assume 0 == ~mode1~0 % 256; 463#L250 assume ~id2~0 >= 0; 465#L251 assume 0 == ~st2~0; 403#L252 assume ~send2~0 == ~id2~0; 404#L253 assume 0 == ~mode2~0 % 256; 445#L254 assume ~id3~0 >= 0; 418#L255 assume 0 == ~st3~0; 419#L256 assume ~send3~0 == ~id3~0; 454#L257 assume 0 == ~mode3~0 % 256; 476#L258 assume ~id4~0 >= 0; 434#L259 assume 0 == ~st4~0; 435#L260 assume ~send4~0 == ~id4~0; 464#L261 assume 0 == ~mode4~0 % 256; 466#L262 assume ~id1~0 != ~id2~0; 405#L263 assume ~id1~0 != ~id3~0; 406#L264 assume ~id1~0 != ~id4~0; 446#L265 assume ~id2~0 != ~id3~0; 420#L266 assume ~id2~0 != ~id4~0; 421#L267 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 458#L244-1 init_#res := init_~tmp~0; 470#L341 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 450#L403-2 [2018-11-23 13:21:38,797 INFO L796 eck$LassoCheckResult]: Loop: 450#L403-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 459#L110 assume !(0 != ~mode1~0 % 256); 455#L128 assume !(0 != ~alive1~0 % 256); 414#L128-2 ~mode1~0 := 1; 415#L110-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 437#L142 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 439#L145 assume !(node2_~m2~0 != ~nomsg~0); 408#L145-1 ~mode2~0 := 0; 427#L142-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 428#L176 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 412#L179 assume !(node3_~m3~0 != ~nomsg~0); 410#L179-1 ~mode3~0 := 0; 411#L176-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 462#L210 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 468#L213 assume !(node4_~m4~0 != ~nomsg~0); 430#L213-1 ~mode4~0 := 0; 440#L210-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 467#L349 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 475#L350 assume ~r1~0 < 4;check_~tmp~1 := 1; 477#L349-1 check_#res := check_~tmp~1; 478#L361 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 483#L430 assume !(0 == assert_~arg % 256); 449#L425 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 450#L403-2 [2018-11-23 13:21:38,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:21:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 2 times [2018-11-23 13:21:38,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:21:38,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:21:38,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:21:38,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:21:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:21:38,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:21:38,830 INFO L82 PathProgramCache]: Analyzing trace with hash -971351118, now seen corresponding path program 1 times [2018-11-23 13:21:38,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:21:38,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:21:38,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:21:38,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:21:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:21:38,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:21:38,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1378393174, now seen corresponding path program 1 times [2018-11-23 13:21:38,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:21:38,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:21:38,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:21:38,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:21:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:21:38,894 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 13:21:38,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:21:38,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:21:39,091 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-11-23 13:21:39,279 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2018-11-23 13:21:39,286 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:21:39,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:21:39,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:21:39,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:21:39,287 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:21:39,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:21:39,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:21:39,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:21:39,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-23 13:21:39,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:21:39,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:21:39,301 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 13:21:39,307 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 13:21:39,309 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 13:21:39,311 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 13:21:39,313 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 13:21:39,319 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 13:21:39,321 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 13:21:39,323 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 13:21:39,325 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 13:21:39,326 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 13:21:39,327 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 13:21:39,329 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 13:21:39,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 13:21:39,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 13:21:39,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 13:21:39,353 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 13:21:39,357 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 13:21:39,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 13:21:39,359 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 13:21:39,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 13:21:39,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 13:21:39,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 13:21:39,369 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 13:21:39,377 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 13:21:39,381 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 13:21:39,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 13:21:39,384 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 13:21:39,386 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 13:21:39,720 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:21:39,720 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/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 13:21:39,724 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:21:39,724 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4fd37442-0c0e-4a48-bd98-1379d72070be/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 13:21:39,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:21:39,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:21:39,836 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:21:39,837 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:21:39,837 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:21:39,837 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:21:39,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:21:39,838 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:21:39,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:21:39,838 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:21:39,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:21:39,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-23 13:21:39,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:21:39,838 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:21:39,840 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 13:21:39,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 13:21:39,845 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 13:21:39,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 13:21:39,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 13:21:39,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 13:21:39,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:21:39,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 13:21:39,855 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 13:21:39,856 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 13:21:39,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 13:21:39,860 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 13:21:39,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 13:21:39,876 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 13:21:39,883 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 13:21:39,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:21:39,889 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 13:21:39,895 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 13:21:39,897 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 13:21:39,903 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 13:21:39,906 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 13:21:39,907 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 13:21:39,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:21:39,910 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 13:21:39,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:21:39,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:21:39,917 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 13:21:39,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:21:40,183 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:21:40,187 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:21:40,188 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 13:21:40,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:21:40,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:21:40,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:21:40,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,196 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 13:21:40,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:21:40,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:21:40,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,202 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 13:21:40,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:21:40,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:21:40,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:21:40,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,204 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 13:21:40,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:21:40,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:21:40,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:21:40,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,210 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 13:21:40,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:21:40,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:21:40,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,214 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 13:21:40,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:21:40,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:21:40,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:21:40,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,217 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 13:21:40,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:21:40,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:21:40,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,222 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 13:21:40,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:21:40,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:21:40,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,226 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 13:21:40,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:21:40,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:21:40,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:21:40,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,228 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 13:21:40,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:21:40,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:21:40,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:21:40,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:21:40,230 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 13:21:40,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:21:40,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:21:40,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:21:40,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:21:40,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:21:40,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:21:40,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:21:40,232 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:21:40,235 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:21:40,235 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:21:40,237 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:21:40,237 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:21:40,237 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:21:40,238 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-11-23 13:21:40,239 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:21:40,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:21:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:21:40,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:21:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:21:40,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:21:40,316 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 13:21:40,319 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 13:21:40,319 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 124 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-23 13:21:40,352 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 124 transitions. cyclomatic complexity: 36. Second operand 3 states. Result 150 states and 221 transitions. Complement of second has 4 states. [2018-11-23 13:21:40,353 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 13:21:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:21:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2018-11-23 13:21:40,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 124 transitions. Stem has 28 letters. Loop has 23 letters. [2018-11-23 13:21:40,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:21:40,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 124 transitions. Stem has 51 letters. Loop has 23 letters. [2018-11-23 13:21:40,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:21:40,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 124 transitions. Stem has 28 letters. Loop has 46 letters. [2018-11-23 13:21:40,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:21:40,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 221 transitions. [2018-11-23 13:21:40,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:21:40,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 0 states and 0 transitions. [2018-11-23 13:21:40,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:21:40,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:21:40,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:21:40,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:21:40,359 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:21:40,359 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:21:40,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:21:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:21:40,359 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-23 13:21:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:21:40,360 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:21:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:21:40,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-23 13:21:40,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:21:40,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:21:40,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:21:40,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:21:40,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:21:40,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:21:40,361 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:21:40,361 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:21:40,361 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:21:40,361 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:21:40,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:21:40,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:21:40,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:21:40,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:21:40 BoogieIcfgContainer [2018-11-23 13:21:40,366 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:21:40,366 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:21:40,366 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:21:40,367 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:21:40,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:38" (3/4) ... [2018-11-23 13:21:40,370 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:21:40,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:21:40,370 INFO L168 Benchmark]: Toolchain (without parser) took 2887.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 959.2 MB in the beginning and 893.6 MB in the end (delta: 65.6 MB). Peak memory consumption was 206.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:21:40,371 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:21:40,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:21:40,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:21:40,372 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:21:40,372 INFO L168 Benchmark]: RCFGBuilder took 431.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:21:40,372 INFO L168 Benchmark]: BuchiAutomizer took 2119.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.6 MB in the end (delta: 197.8 MB). Peak memory consumption was 197.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:21:40,373 INFO L168 Benchmark]: Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 893.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:21:40,375 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 431.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2119.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.6 MB in the end (delta: 197.8 MB). Peak memory consumption was 197.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 893.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 89 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 400 SDtfs, 220 SDslu, 740 SDs, 0 SdLazy, 22 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital120 mio100 ax139 hnf109 lsp25 ukn100 mio100 lsp100 div106 bol100 ite100 ukn100 eq214 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...