./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.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_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/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 91fda61e05234dbe68b069d372f5d4b0bb73b229 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:11:06,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:11:06,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:11:06,974 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:11:06,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:11:06,975 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:11:06,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:11:06,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:11:06,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:11:06,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:11:06,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:11:06,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:11:06,981 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:11:06,982 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:11:06,982 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:11:06,983 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:11:06,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:11:06,985 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:11:06,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:11:06,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:11:06,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:11:06,989 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:11:06,990 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:11:06,990 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:11:06,990 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:11:06,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:11:06,992 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:11:06,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:11:06,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:11:06,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:11:06,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:11:06,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:11:06,994 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:11:06,994 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:11:06,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:11:06,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:11:06,996 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 07:11:07,006 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:11:07,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:11:07,007 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:11:07,007 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:11:07,008 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:11:07,008 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:11:07,008 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:11:07,008 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:11:07,008 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:11:07,008 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:11:07,008 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:11:07,008 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:11:07,009 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:11:07,009 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:11:07,009 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:11:07,009 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:11:07,009 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:11:07,009 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:11:07,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:11:07,009 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:11:07,010 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:11:07,010 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:11:07,010 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:11:07,010 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:11:07,010 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:11:07,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:11:07,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:11:07,010 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:11:07,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:11:07,011 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:11:07,011 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:11:07,011 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:11:07,012 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_b33c9e16-ca72-4b53-82f7-d321ca3812ca/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 -> 91fda61e05234dbe68b069d372f5d4b0bb73b229 [2018-11-23 07:11:07,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:11:07,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:11:07,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:11:07,047 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:11:07,047 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:11:07,047 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-23 07:11:07,086 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/data/b70b51d92/956ab0b322af40648b3fc07902661186/FLAG47b27eada [2018-11-23 07:11:07,502 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:11:07,502 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/sv-benchmarks/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-23 07:11:07,508 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/data/b70b51d92/956ab0b322af40648b3fc07902661186/FLAG47b27eada [2018-11-23 07:11:07,516 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/data/b70b51d92/956ab0b322af40648b3fc07902661186 [2018-11-23 07:11:07,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:11:07,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:11:07,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:11:07,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:11:07,522 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:11:07,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1422d941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07, skipping insertion in model container [2018-11-23 07:11:07,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:11:07,548 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:11:07,663 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:11:07,666 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:11:07,681 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:11:07,691 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:11:07,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07 WrapperNode [2018-11-23 07:11:07,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:11:07,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:11:07,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:11:07,693 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:11:07,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:11:07,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:11:07,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:11:07,718 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:11:07,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... [2018-11-23 07:11:07,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:11:07,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:11:07,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:11:07,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:11:07,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/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 07:11:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:11:07,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:11:07,935 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:11:07,936 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 07:11:07,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:11:07 BoogieIcfgContainer [2018-11-23 07:11:07,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:11:07,936 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:11:07,936 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:11:07,939 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:11:07,939 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:11:07,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:11:07" (1/3) ... [2018-11-23 07:11:07,940 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29089d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:11:07, skipping insertion in model container [2018-11-23 07:11:07,940 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:11:07,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:11:07" (2/3) ... [2018-11-23 07:11:07,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29089d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:11:07, skipping insertion in model container [2018-11-23 07:11:07,941 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:11:07,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:11:07" (3/3) ... [2018-11-23 07:11:07,942 INFO L375 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-23 07:11:07,988 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:11:07,988 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:11:07,989 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:11:07,989 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:11:07,989 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:11:07,989 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:11:07,989 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:11:07,989 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:11:07,989 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:11:08,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-23 07:11:08,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 07:11:08,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:11:08,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:11:08,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 07:11:08,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:11:08,027 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:11:08,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-23 07:11:08,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 07:11:08,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:11:08,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:11:08,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 07:11:08,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:11:08,036 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 24#L100true [2018-11-23 07:11:08,036 INFO L796 eck$LassoCheckResult]: Loop: 24#L100true assume !false; 8#L19true assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22#L25true assume 8466 == main_~s__state~0; 4#L26true assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; 23#L58-1true assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 24#L100true [2018-11-23 07:11:08,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:08,041 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 07:11:08,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:08,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:08,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:08,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:08,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:08,113 INFO L82 PathProgramCache]: Analyzing trace with hash 38329778, now seen corresponding path program 1 times [2018-11-23 07:11:08,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:08,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:08,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash 925833459, now seen corresponding path program 1 times [2018-11-23 07:11:08,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:08,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:08,189 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:11:08,190 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:11:08,190 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:11:08,190 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:11:08,190 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:11:08,191 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:08,191 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:11:08,191 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:11:08,191 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration1_Loop [2018-11-23 07:11:08,191 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:11:08,191 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:11:08,205 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 07:11:08,213 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 07:11:08,215 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 07:11:08,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:11:08,302 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/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 07:11:08,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:11:08,310 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/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 07:11:08,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:11:08,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:11:08,349 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:11:08,363 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:11:08,363 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:11:08,363 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:11:08,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:11:08,363 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:11:08,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:08,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:11:08,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:11:08,364 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration1_Loop [2018-11-23 07:11:08,364 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:11:08,364 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:11:08,365 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 07:11:08,370 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 07:11:08,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:11:08,426 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:11:08,429 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:11:08,430 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 07:11:08,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:11:08,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:11:08,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:11:08,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:11:08,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:11:08,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:11:08,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:11:08,439 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:11:08,443 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:11:08,444 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 07:11:08,445 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:11:08,445 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:11:08,446 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:11:08,446 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8561 Supporting invariants [] [2018-11-23 07:11:08,447 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:11:08,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:08,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:11:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:08,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:11:08,505 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 07:11:08,515 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 07:11:08,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-11-23 07:11:08,582 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 68 states and 107 transitions. Complement of second has 8 states. [2018-11-23 07:11:08,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:11:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:11:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 07:11:08,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 1 letters. Loop has 5 letters. [2018-11-23 07:11:08,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:11:08,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 6 letters. Loop has 5 letters. [2018-11-23 07:11:08,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:11:08,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 1 letters. Loop has 10 letters. [2018-11-23 07:11:08,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:11:08,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 107 transitions. [2018-11-23 07:11:08,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 07:11:08,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 36 states and 55 transitions. [2018-11-23 07:11:08,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 07:11:08,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 07:11:08,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 55 transitions. [2018-11-23 07:11:08,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:11:08,594 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 55 transitions. [2018-11-23 07:11:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 55 transitions. [2018-11-23 07:11:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2018-11-23 07:11:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 07:11:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-11-23 07:11:08,613 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-11-23 07:11:08,613 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-11-23 07:11:08,613 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:11:08,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 38 transitions. [2018-11-23 07:11:08,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 07:11:08,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:11:08,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:11:08,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:11:08,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 07:11:08,614 INFO L794 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 158#L100 assume !false; 148#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 149#L25 assume !(8466 == main_~s__state~0); 153#L30 [2018-11-23 07:11:08,615 INFO L796 eck$LassoCheckResult]: Loop: 153#L30 assume 8512 == main_~s__state~0; 154#L31 main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; 143#L70 assume 0 != main_~tmp___1~0;main_~s__state~0 := 8466; 144#L100 assume !false; 160#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 161#L25 assume !(8466 == main_~s__state~0); 153#L30 [2018-11-23 07:11:08,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash 963407, now seen corresponding path program 1 times [2018-11-23 07:11:08,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:08,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:08,633 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 07:11:08,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:11:08,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 07:11:08,636 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:11:08,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1593739222, now seen corresponding path program 1 times [2018-11-23 07:11:08,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:08,649 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 07:11:08,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:11:08,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:11:08,649 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:11:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:11:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:11:08,652 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-23 07:11:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:11:08,670 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2018-11-23 07:11:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:11:08,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. [2018-11-23 07:11:08,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-23 07:11:08,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 42 transitions. [2018-11-23 07:11:08,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 07:11:08,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 07:11:08,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 42 transitions. [2018-11-23 07:11:08,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:11:08,673 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2018-11-23 07:11:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 42 transitions. [2018-11-23 07:11:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 07:11:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 07:11:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-23 07:11:08,676 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-11-23 07:11:08,676 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-11-23 07:11:08,676 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:11:08,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2018-11-23 07:11:08,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-23 07:11:08,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:11:08,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:11:08,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-23 07:11:08,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 07:11:08,678 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 223#L100 assume !false; 215#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 216#L25 assume 8466 == main_~s__state~0; 205#L26 assume !(0 == main_~blastFlag~0); 206#L58-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 225#L100 assume !false; 226#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 224#L25 assume !(8466 == main_~s__state~0); 218#L30 [2018-11-23 07:11:08,678 INFO L796 eck$LassoCheckResult]: Loop: 218#L30 assume 8512 == main_~s__state~0; 219#L31 main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; 207#L70 assume !(0 != main_~tmp___1~0);main_~s__state~0 := 8640; 209#L100 assume !false; 228#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 227#L25 assume !(8466 == main_~s__state~0); 218#L30 [2018-11-23 07:11:08,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash -773481124, now seen corresponding path program 1 times [2018-11-23 07:11:08,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:08,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:11:08,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:11:08,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:11:08,698 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:11:08,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1593798804, now seen corresponding path program 1 times [2018-11-23 07:11:08,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:08,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:08,717 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:11:08,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:11:08,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:11:08,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:11:08,717 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:11:08,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:08,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:11:08,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:11:08,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 07:11:08,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:11:08,717 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:11:08,718 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 07:11:08,726 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 07:11:08,765 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:11:08,765 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:08,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:11:08,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:11:08,778 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:11:08,778 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0, ULTIMATE.start_main_~tmp___1~0=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0, ULTIMATE.start_main_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:08,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:11:08,803 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-23 07:11:08,831 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:11:08,831 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:08,835 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:11:08,855 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:11:08,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:11:08,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:11:08,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:11:08,856 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:11:08,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:08,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:11:08,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:11:08,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 07:11:08,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:11:08,857 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:11:08,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 07:11:08,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:11:08,895 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:11:08,895 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:11:08,896 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 07:11:08,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:11:08,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:11:08,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:11:08,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:11:08,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:11:08,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:11:08,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:11:08,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:11:08,900 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 07:11:08,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:11:08,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:11:08,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:11:08,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:11:08,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:11:08,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:11:08,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:11:08,907 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:11:08,911 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:11:08,911 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 07:11:08,911 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:11:08,911 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:11:08,912 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:11:08,912 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8576 Supporting invariants [] [2018-11-23 07:11:08,912 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:11:08,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:08,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:11:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:08,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:11:08,954 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 07:11:08,954 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 07:11:08,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 40 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-23 07:11:09,030 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 40 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 88 states and 133 transitions. Complement of second has 9 states. [2018-11-23 07:11:09,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 07:11:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:11:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 07:11:09,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-23 07:11:09,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:11:09,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 07:11:09,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:11:09,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-23 07:11:09,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:11:09,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 133 transitions. [2018-11-23 07:11:09,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-23 07:11:09,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 78 states and 115 transitions. [2018-11-23 07:11:09,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-23 07:11:09,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-23 07:11:09,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 115 transitions. [2018-11-23 07:11:09,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:11:09,037 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 115 transitions. [2018-11-23 07:11:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 115 transitions. [2018-11-23 07:11:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2018-11-23 07:11:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 07:11:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2018-11-23 07:11:09,042 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2018-11-23 07:11:09,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:11:09,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:11:09,043 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. Second operand 3 states. [2018-11-23 07:11:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:11:09,070 INFO L93 Difference]: Finished difference Result 61 states and 86 transitions. [2018-11-23 07:11:09,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:11:09,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 86 transitions. [2018-11-23 07:11:09,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-23 07:11:09,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 86 transitions. [2018-11-23 07:11:09,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 07:11:09,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 07:11:09,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 86 transitions. [2018-11-23 07:11:09,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:11:09,073 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 86 transitions. [2018-11-23 07:11:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 86 transitions. [2018-11-23 07:11:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 07:11:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 07:11:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2018-11-23 07:11:09,077 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 86 transitions. [2018-11-23 07:11:09,077 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 86 transitions. [2018-11-23 07:11:09,077 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:11:09,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 86 transitions. [2018-11-23 07:11:09,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-23 07:11:09,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:11:09,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:11:09,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 07:11:09,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:11:09,079 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 536#L100 assume !false; 526#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 527#L25 assume 8466 == main_~s__state~0; 513#L26 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; 514#L58-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 541#L100 assume !false; 562#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 539#L25 assume !(8466 == main_~s__state~0); 540#L30 assume 8512 == main_~s__state~0; 530#L31 [2018-11-23 07:11:09,080 INFO L796 eck$LassoCheckResult]: Loop: 530#L31 main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; 515#L70 assume 0 != main_~tmp___1~0;main_~s__state~0 := 8466; 516#L100 assume !false; 542#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 561#L25 assume 8466 == main_~s__state~0; 551#L26 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; 557#L58-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 555#L100 assume !false; 553#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 550#L25 assume !(8466 == main_~s__state~0); 529#L30 assume 8512 == main_~s__state~0; 530#L31 [2018-11-23 07:11:09,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:09,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1734630653, now seen corresponding path program 1 times [2018-11-23 07:11:09,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:09,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:09,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:09,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1916324967, now seen corresponding path program 1 times [2018-11-23 07:11:09,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:09,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:09,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:09,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:09,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:09,096 INFO L82 PathProgramCache]: Analyzing trace with hash -902815459, now seen corresponding path program 1 times [2018-11-23 07:11:09,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:09,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:09,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:09,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 07:11:09,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:11:09,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:11:09,160 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:11:09,160 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:11:09,160 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:11:09,160 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:11:09,160 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:11:09,161 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:09,161 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:11:09,161 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:11:09,161 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration4_Loop [2018-11-23 07:11:09,161 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:11:09,161 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:11:09,164 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 07:11:09,166 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 07:11:09,171 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 07:11:09,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:11:09,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:11:09,223 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:09,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:11:09,225 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:11:09,227 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:11:09,227 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0=0} Honda state: {ULTIMATE.start_main_~s__hit~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:09,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:11:09,243 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:09,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:11:09,260 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:11:09,263 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:11:09,277 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:11:09,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:11:09,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:11:09,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:11:09,277 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:11:09,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:11:09,277 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:11:09,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:11:09,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration4_Loop [2018-11-23 07:11:09,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:11:09,278 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:11:09,278 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 07:11:09,282 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 07:11:09,305 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 07:11:09,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 07:11:09,360 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:11:09,360 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:11:09,360 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 07:11:09,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:11:09,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:11:09,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:11:09,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:11:09,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:11:09,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:11:09,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:11:09,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:11:09,364 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 07:11:09,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:11:09,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:11:09,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:11:09,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:11:09,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:11:09,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:11:09,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:11:09,373 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:11:09,377 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:11:09,378 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 07:11:09,378 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:11:09,378 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:11:09,378 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:11:09,378 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~blastFlag~0) = -1*ULTIMATE.start_main_~blastFlag~0 + 1 Supporting invariants [] [2018-11-23 07:11:09,379 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:11:09,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:09,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:11:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:11:09,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:11:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:11:09,414 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 07:11:09,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 86 transitions. cyclomatic complexity: 29 Second operand 4 states. [2018-11-23 07:11:09,449 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 86 transitions. cyclomatic complexity: 29. Second operand 4 states. Result 134 states and 196 transitions. Complement of second has 4 states. [2018-11-23 07:11:09,451 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 07:11:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:11:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2018-11-23 07:11:09,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 10 letters. Loop has 11 letters. [2018-11-23 07:11:09,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:11:09,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 21 letters. Loop has 11 letters. [2018-11-23 07:11:09,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:11:09,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 10 letters. Loop has 22 letters. [2018-11-23 07:11:09,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:11:09,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 196 transitions. [2018-11-23 07:11:09,455 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2018-11-23 07:11:09,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 196 transitions. [2018-11-23 07:11:09,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-11-23 07:11:09,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-23 07:11:09,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 196 transitions. [2018-11-23 07:11:09,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:11:09,456 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 196 transitions. [2018-11-23 07:11:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 196 transitions. [2018-11-23 07:11:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2018-11-23 07:11:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 07:11:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 191 transitions. [2018-11-23 07:11:09,463 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 191 transitions. [2018-11-23 07:11:09,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:11:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:11:09,464 INFO L87 Difference]: Start difference. First operand 130 states and 191 transitions. Second operand 3 states. [2018-11-23 07:11:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:11:09,476 INFO L93 Difference]: Finished difference Result 127 states and 176 transitions. [2018-11-23 07:11:09,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:11:09,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 176 transitions. [2018-11-23 07:11:09,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2018-11-23 07:11:09,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 78 states and 106 transitions. [2018-11-23 07:11:09,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 07:11:09,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 07:11:09,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 106 transitions. [2018-11-23 07:11:09,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:11:09,481 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 106 transitions. [2018-11-23 07:11:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 106 transitions. [2018-11-23 07:11:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2018-11-23 07:11:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 07:11:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2018-11-23 07:11:09,484 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-23 07:11:09,484 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-23 07:11:09,484 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:11:09,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 82 transitions. [2018-11-23 07:11:09,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-23 07:11:09,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:11:09,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:11:09,485 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 07:11:09,485 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:11:09,485 INFO L794 eck$LassoCheckResult]: Stem: 1071#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 1072#L100 assume !false; 1088#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1086#L25 assume 8466 == main_~s__state~0; 1084#L26 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; 1075#L58-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 1076#L100 assume !false; 1090#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1093#L25 assume !(8466 == main_~s__state~0); 1092#L30 assume 8512 == main_~s__state~0; 1066#L31 [2018-11-23 07:11:09,486 INFO L796 eck$LassoCheckResult]: Loop: 1066#L31 main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; 1069#L70 assume 0 != main_~tmp___1~0;main_~s__state~0 := 8466; 1101#L100 assume !false; 1102#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1099#L25 assume 8466 == main_~s__state~0; 1095#L26 assume !(0 == main_~blastFlag~0); 1098#L58-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 1097#L100 assume !false; 1096#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1094#L25 assume !(8466 == main_~s__state~0); 1065#L30 assume 8512 == main_~s__state~0; 1066#L31 [2018-11-23 07:11:09,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1734630653, now seen corresponding path program 2 times [2018-11-23 07:11:09,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:09,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:09,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1859066665, now seen corresponding path program 1 times [2018-11-23 07:11:09,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:09,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:09,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:11:09,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:09,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:11:09,499 INFO L82 PathProgramCache]: Analyzing trace with hash -845557157, now seen corresponding path program 1 times [2018-11-23 07:11:09,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:11:09,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:11:09,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:11:09,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:11:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:11:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume 8466 == main_~s__state~0; [?] assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; [?] assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume !(8466 == main_~s__state~0); [?] assume 8512 == main_~s__state~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume 0 == main_~blastFlag~0; [L59] main_~blastFlag~0 := 2; [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume 0 == main_~blastFlag~0; [L59] main_~blastFlag~0 := 2; [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND TRUE 0 == main_~blastFlag~0 [L59] main_~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND TRUE 0 == main_~blastFlag~0 [L59] main_~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 [L10] havoc ~s__state~0; [L11] ~s__hit~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~blastFlag~0; [L13] havoc ~tmp___1~0; [L15] ~s__state~0 := 8466; [L16] ~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND TRUE 0 == ~blastFlag~0 [L59] ~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] havoc ~s__state~0; [L11] ~s__hit~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~blastFlag~0; [L13] havoc ~tmp___1~0; [L15] ~s__state~0 := 8466; [L16] ~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND TRUE 0 == ~blastFlag~0 [L59] ~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 [L10] int s__state ; [L11] int s__hit = __VERIFIER_nondet_int() ; [L12] int blastFlag ; [L13] int tmp___1; [L15] s__state = 8466 [L16] blastFlag = 0 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND TRUE blastFlag == 0 [L59] blastFlag = 2 [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] assume 0 != main_~tmp___1~0;main_~s__state~0 := 8466; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume 8466 == main_~s__state~0; [?] assume !(0 == main_~blastFlag~0); [?] assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume !(8466 == main_~s__state~0); [?] assume 8512 == main_~s__state~0; [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] assume 0 != main_~tmp___1~0; [L71] main_~s__state~0 := 8466; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume !(0 == main_~blastFlag~0); [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] assume 0 != main_~tmp___1~0; [L71] main_~s__state~0 := 8466; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume !(0 == main_~blastFlag~0); [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] COND TRUE 0 != main_~tmp___1~0 [L71] main_~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND FALSE !(0 == main_~blastFlag~0) [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] COND TRUE 0 != main_~tmp___1~0 [L71] main_~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND FALSE !(0 == main_~blastFlag~0) [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 [L69] ~tmp___1~0 := #t~nondet1; [L69] havoc #t~nondet1; [L70-L74] COND TRUE 0 != ~tmp___1~0 [L71] ~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND FALSE !(0 == ~blastFlag~0) [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L69] ~tmp___1~0 := #t~nondet1; [L69] havoc #t~nondet1; [L70-L74] COND TRUE 0 != ~tmp___1~0 [L71] ~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND FALSE !(0 == ~blastFlag~0) [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 [L69] tmp___1 = __VERIFIER_nondet_int() [L70] COND TRUE \read(tmp___1) [L71] s__state = 8466 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND FALSE !(blastFlag == 0) [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 ----- [2018-11-23 07:11:09,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:11:09 BoogieIcfgContainer [2018-11-23 07:11:09,584 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:11:09,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:11:09,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:11:09,584 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:11:09,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:11:07" (3/4) ... [2018-11-23 07:11:09,587 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume 8466 == main_~s__state~0; [?] assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; [?] assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume !(8466 == main_~s__state~0); [?] assume 8512 == main_~s__state~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume 0 == main_~blastFlag~0; [L59] main_~blastFlag~0 := 2; [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume 0 == main_~blastFlag~0; [L59] main_~blastFlag~0 := 2; [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND TRUE 0 == main_~blastFlag~0 [L59] main_~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND TRUE 0 == main_~blastFlag~0 [L59] main_~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 [L10] havoc ~s__state~0; [L11] ~s__hit~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~blastFlag~0; [L13] havoc ~tmp___1~0; [L15] ~s__state~0 := 8466; [L16] ~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND TRUE 0 == ~blastFlag~0 [L59] ~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] havoc ~s__state~0; [L11] ~s__hit~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~blastFlag~0; [L13] havoc ~tmp___1~0; [L15] ~s__state~0 := 8466; [L16] ~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND TRUE 0 == ~blastFlag~0 [L59] ~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 [L10] int s__state ; [L11] int s__hit = __VERIFIER_nondet_int() ; [L12] int blastFlag ; [L13] int tmp___1; [L15] s__state = 8466 [L16] blastFlag = 0 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND TRUE blastFlag == 0 [L59] blastFlag = 2 [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] assume 0 != main_~tmp___1~0;main_~s__state~0 := 8466; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume 8466 == main_~s__state~0; [?] assume !(0 == main_~blastFlag~0); [?] assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume !(8466 == main_~s__state~0); [?] assume 8512 == main_~s__state~0; [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] assume 0 != main_~tmp___1~0; [L71] main_~s__state~0 := 8466; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume !(0 == main_~blastFlag~0); [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] assume 0 != main_~tmp___1~0; [L71] main_~s__state~0 := 8466; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume !(0 == main_~blastFlag~0); [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] COND TRUE 0 != main_~tmp___1~0 [L71] main_~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND FALSE !(0 == main_~blastFlag~0) [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] COND TRUE 0 != main_~tmp___1~0 [L71] main_~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND FALSE !(0 == main_~blastFlag~0) [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 [L69] ~tmp___1~0 := #t~nondet1; [L69] havoc #t~nondet1; [L70-L74] COND TRUE 0 != ~tmp___1~0 [L71] ~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND FALSE !(0 == ~blastFlag~0) [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L69] ~tmp___1~0 := #t~nondet1; [L69] havoc #t~nondet1; [L70-L74] COND TRUE 0 != ~tmp___1~0 [L71] ~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND FALSE !(0 == ~blastFlag~0) [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 [L69] tmp___1 = __VERIFIER_nondet_int() [L70] COND TRUE \read(tmp___1) [L71] s__state = 8466 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND FALSE !(blastFlag == 0) [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 ----- [2018-11-23 07:11:09,625 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b33c9e16-ca72-4b53-82f7-d321ca3812ca/bin-2019/uautomizer/witness.graphml [2018-11-23 07:11:09,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:11:09,626 INFO L168 Benchmark]: Toolchain (without parser) took 2107.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 958.4 MB in the beginning and 868.5 MB in the end (delta: 90.0 MB). Peak memory consumption was 231.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:11:09,627 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:11:09,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.4 MB in the beginning and 947.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:11:09,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.77 ms. Allocated memory is still 1.0 GB. Free memory was 947.5 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:11:09,628 INFO L168 Benchmark]: Boogie Preprocessor took 50.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:11:09,633 INFO L168 Benchmark]: RCFGBuilder took 168.41 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:11:09,633 INFO L168 Benchmark]: BuchiAutomizer took 1647.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.8 MB in the end (delta: 249.5 MB). Peak memory consumption was 249.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:11:09,633 INFO L168 Benchmark]: Witness Printer took 41.18 ms. Allocated memory is still 1.2 GB. Free memory was 871.8 MB in the beginning and 868.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:11:09,636 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.4 MB in the beginning and 947.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.77 ms. Allocated memory is still 1.0 GB. Free memory was 947.5 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 168.41 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1647.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.8 MB in the end (delta: 249.5 MB). Peak memory consumption was 249.5 MB. Max. memory is 11.5 GB. * Witness Printer took 41.18 ms. Allocated memory is still 1.2 GB. Free memory was 871.8 MB in the beginning and 868.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. 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 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * s__state + 8561 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8576 and consists of 5 locations. One deterministic module has affine ranking function -1 * blastFlag + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 61 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 54 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 61 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 164 SDtfs, 126 SDslu, 105 SDs, 0 SdLazy, 141 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp48 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq196 hnf89 smp100 dnf116 smp100 tf112 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 30]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fc73041=0, \result=0, tmp___1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55dd803f=1, s__hit=0, blastFlag=2, s__state=8512} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume 8466 == main_~s__state~0; [?] assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; [?] assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume !(8466 == main_~s__state~0); [?] assume 8512 == main_~s__state~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume 0 == main_~blastFlag~0; [L59] main_~blastFlag~0 := 2; [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume 0 == main_~blastFlag~0; [L59] main_~blastFlag~0 := 2; [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND TRUE 0 == main_~blastFlag~0 [L59] main_~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND TRUE 0 == main_~blastFlag~0 [L59] main_~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 [L10] havoc ~s__state~0; [L11] ~s__hit~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~blastFlag~0; [L13] havoc ~tmp___1~0; [L15] ~s__state~0 := 8466; [L16] ~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND TRUE 0 == ~blastFlag~0 [L59] ~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] havoc ~s__state~0; [L11] ~s__hit~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~blastFlag~0; [L13] havoc ~tmp___1~0; [L15] ~s__state~0 := 8466; [L16] ~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND TRUE 0 == ~blastFlag~0 [L59] ~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 [L10] int s__state ; [L11] int s__hit = __VERIFIER_nondet_int() ; [L12] int blastFlag ; [L13] int tmp___1; [L15] s__state = 8466 [L16] blastFlag = 0 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND TRUE blastFlag == 0 [L59] blastFlag = 2 [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] assume 0 != main_~tmp___1~0;main_~s__state~0 := 8466; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume 8466 == main_~s__state~0; [?] assume !(0 == main_~blastFlag~0); [?] assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume !(8466 == main_~s__state~0); [?] assume 8512 == main_~s__state~0; [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] assume 0 != main_~tmp___1~0; [L71] main_~s__state~0 := 8466; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume !(0 == main_~blastFlag~0); [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] assume 0 != main_~tmp___1~0; [L71] main_~s__state~0 := 8466; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume !(0 == main_~blastFlag~0); [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] COND TRUE 0 != main_~tmp___1~0 [L71] main_~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND FALSE !(0 == main_~blastFlag~0) [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] COND TRUE 0 != main_~tmp___1~0 [L71] main_~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND FALSE !(0 == main_~blastFlag~0) [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 [L69] ~tmp___1~0 := #t~nondet1; [L69] havoc #t~nondet1; [L70-L74] COND TRUE 0 != ~tmp___1~0 [L71] ~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND FALSE !(0 == ~blastFlag~0) [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L69] ~tmp___1~0 := #t~nondet1; [L69] havoc #t~nondet1; [L70-L74] COND TRUE 0 != ~tmp___1~0 [L71] ~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND FALSE !(0 == ~blastFlag~0) [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 [L69] tmp___1 = __VERIFIER_nondet_int() [L70] COND TRUE \read(tmp___1) [L71] s__state = 8466 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND FALSE !(blastFlag == 0) [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume 8466 == main_~s__state~0; [?] assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; [?] assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume !(8466 == main_~s__state~0); [?] assume 8512 == main_~s__state~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume 0 == main_~blastFlag~0; [L59] main_~blastFlag~0 := 2; [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume 0 == main_~blastFlag~0; [L59] main_~blastFlag~0 := 2; [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND TRUE 0 == main_~blastFlag~0 [L59] main_~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0; [L10] havoc main_~s__state~0; [L11] main_~s__hit~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; [L12] havoc main_~blastFlag~0; [L13] havoc main_~tmp___1~0; [L15] main_~s__state~0 := 8466; [L16] main_~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND TRUE 0 == main_~blastFlag~0 [L59] main_~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 [L10] havoc ~s__state~0; [L11] ~s__hit~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~blastFlag~0; [L13] havoc ~tmp___1~0; [L15] ~s__state~0 := 8466; [L16] ~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND TRUE 0 == ~blastFlag~0 [L59] ~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] havoc ~s__state~0; [L11] ~s__hit~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~blastFlag~0; [L13] havoc ~tmp___1~0; [L15] ~s__state~0 := 8466; [L16] ~blastFlag~0 := 0; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND TRUE 0 == ~blastFlag~0 [L59] ~blastFlag~0 := 2; [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 [L10] int s__state ; [L11] int s__hit = __VERIFIER_nondet_int() ; [L12] int blastFlag ; [L13] int tmp___1; [L15] s__state = 8466 [L16] blastFlag = 0 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND TRUE blastFlag == 0 [L59] blastFlag = 2 [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] assume 0 != main_~tmp___1~0;main_~s__state~0 := 8466; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume 8466 == main_~s__state~0; [?] assume !(0 == main_~blastFlag~0); [?] assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; [?] assume !false; [?] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [?] assume !(8466 == main_~s__state~0); [?] assume 8512 == main_~s__state~0; [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] assume 0 != main_~tmp___1~0; [L71] main_~s__state~0 := 8466; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume !(0 == main_~blastFlag~0); [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] assume 0 != main_~tmp___1~0; [L71] main_~s__state~0 := 8466; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume 8466 == main_~s__state~0; [L58-L60] assume !(0 == main_~blastFlag~0); [L61-L65] assume !(0 != main_~s__hit~0); [L64] main_~s__state~0 := 8512; [L18-L135] assume !false; [L19] assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); [L25-L128] assume !(8466 == main_~s__state~0); [L30-L125] assume 8512 == main_~s__state~0; [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] COND TRUE 0 != main_~tmp___1~0 [L71] main_~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND FALSE !(0 == main_~blastFlag~0) [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L69] main_~tmp___1~0 := main_#t~nondet1; [L69] havoc main_#t~nondet1; [L70-L74] COND TRUE 0 != main_~tmp___1~0 [L71] main_~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND TRUE 8466 == main_~s__state~0 [L58] COND FALSE !(0 == main_~blastFlag~0) [L61-L65] COND FALSE !(0 != main_~s__hit~0) [L64] main_~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2) [L25] COND FALSE !(8466 == main_~s__state~0) [L30] COND TRUE 8512 == main_~s__state~0 [L69] ~tmp___1~0 := #t~nondet1; [L69] havoc #t~nondet1; [L70-L74] COND TRUE 0 != ~tmp___1~0 [L71] ~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND FALSE !(0 == ~blastFlag~0) [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L69] ~tmp___1~0 := #t~nondet1; [L69] havoc #t~nondet1; [L70-L74] COND TRUE 0 != ~tmp___1~0 [L71] ~s__state~0 := 8466; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND TRUE 8466 == ~s__state~0 [L58] COND FALSE !(0 == ~blastFlag~0) [L61-L65] COND FALSE !(0 != ~s__hit~0) [L64] ~s__state~0 := 8512; [L18-L135] COND FALSE !(false) [L19] COND FALSE !(~s__state~0 <= 8512 && ~blastFlag~0 > 2) [L25] COND FALSE !(8466 == ~s__state~0) [L30] COND TRUE 8512 == ~s__state~0 [L69] tmp___1 = __VERIFIER_nondet_int() [L70] COND TRUE \read(tmp___1) [L71] s__state = 8466 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND FALSE !(blastFlag == 0) [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int s__state ; [L11] int s__hit = __VERIFIER_nondet_int() ; [L12] int blastFlag ; [L13] int tmp___1; [L15] s__state = 8466 [L16] blastFlag = 0 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND TRUE blastFlag == 0 [L59] blastFlag = 2 [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 Loop: [L69] tmp___1 = __VERIFIER_nondet_int() [L70] COND TRUE \read(tmp___1) [L71] s__state = 8466 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND FALSE !(blastFlag == 0) [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...