./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/trex04_true-unreach-call_false-termination.i --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_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/trex04_true-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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 ebd700d2a774ad3ca11fe220b69fa701cbe412e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:26:06,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:26:06,903 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:26:06,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:26:06,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:26:06,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:26:06,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:26:06,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:26:06,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:26:06,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:26:06,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:26:06,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:26:06,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:26:06,918 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:26:06,919 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:26:06,919 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:26:06,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:26:06,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:26:06,922 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:26:06,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:26:06,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:26:06,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:26:06,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:26:06,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:26:06,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:26:06,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:26:06,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:26:06,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:26:06,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:26:06,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:26:06,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:26:06,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:26:06,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:26:06,930 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:26:06,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:26:06,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:26:06,931 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 07:26:06,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:26:06,940 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:26:06,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:26:06,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:26:06,941 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:26:06,942 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:26:06,942 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:26:06,942 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:26:06,942 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:26:06,942 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:26:06,942 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:26:06,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:26:06,943 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:26:06,943 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:26:06,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:26:06,943 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:26:06,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:26:06,943 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:26:06,943 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:26:06,943 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:26:06,944 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:26:06,944 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:26:06,944 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:26:06,944 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:26:06,944 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:26:06,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:26:06,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:26:06,944 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:26:06,945 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:26:06,945 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:26:06,945 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:26:06,945 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:26:06,946 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_97d71eb2-1eff-4e23-accc-2e672c0a112a/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 -> ebd700d2a774ad3ca11fe220b69fa701cbe412e1 [2018-11-23 07:26:06,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:26:06,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:26:06,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:26:06,979 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:26:06,980 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:26:06,981 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/../../sv-benchmarks/c/loops/trex04_true-unreach-call_false-termination.i [2018-11-23 07:26:07,021 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/data/941894103/f11d36367ec34fa8a601014a26365925/FLAG4e191965d [2018-11-23 07:26:07,321 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:26:07,322 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/sv-benchmarks/c/loops/trex04_true-unreach-call_false-termination.i [2018-11-23 07:26:07,327 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/data/941894103/f11d36367ec34fa8a601014a26365925/FLAG4e191965d [2018-11-23 07:26:07,336 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/data/941894103/f11d36367ec34fa8a601014a26365925 [2018-11-23 07:26:07,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:26:07,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:26:07,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:26:07,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:26:07,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:26:07,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:26:07" (1/1) ... [2018-11-23 07:26:07,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa4fa66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07, skipping insertion in model container [2018-11-23 07:26:07,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:26:07" (1/1) ... [2018-11-23 07:26:07,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:26:07,364 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:26:07,472 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:26:07,474 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:26:07,486 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:26:07,495 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:26:07,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07 WrapperNode [2018-11-23 07:26:07,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:26:07,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:26:07,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:26:07,496 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:26:07,500 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:26:07" (1/1) ... [2018-11-23 07:26:07,504 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:26:07" (1/1) ... [2018-11-23 07:26:07,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:26:07,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:26:07,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:26:07,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:26:07,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07" (1/1) ... [2018-11-23 07:26:07,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07" (1/1) ... [2018-11-23 07:26:07,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07" (1/1) ... [2018-11-23 07:26:07,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07" (1/1) ... [2018-11-23 07:26:07,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07" (1/1) ... [2018-11-23 07:26:07,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07" (1/1) ... [2018-11-23 07:26:07,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07" (1/1) ... [2018-11-23 07:26:07,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:26:07,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:26:07,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:26:07,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:26:07,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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:26:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:26:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:26:07,715 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:26:07,715 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 07:26:07,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:26:07 BoogieIcfgContainer [2018-11-23 07:26:07,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:26:07,716 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:26:07,716 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:26:07,719 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:26:07,719 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:26:07,719 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:26:07" (1/3) ... [2018-11-23 07:26:07,720 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aa750ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:26:07, skipping insertion in model container [2018-11-23 07:26:07,720 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:26:07,720 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:07" (2/3) ... [2018-11-23 07:26:07,721 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aa750ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:26:07, skipping insertion in model container [2018-11-23 07:26:07,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:26:07,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:26:07" (3/3) ... [2018-11-23 07:26:07,722 INFO L375 chiAutomizerObserver]: Analyzing ICFG trex04_true-unreach-call_false-termination.i [2018-11-23 07:26:07,759 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:26:07,760 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:26:07,760 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:26:07,760 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:26:07,760 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:26:07,760 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:26:07,760 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:26:07,760 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:26:07,760 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:26:07,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 07:26:07,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 07:26:07,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:26:07,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:26:07,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:26:07,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 07:26:07,793 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:26:07,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 07:26:07,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 07:26:07,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:26:07,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:26:07,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:26:07,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 07:26:07,799 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1;main_~d~0 := 1;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 13#L23true assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000);main_~c1~1 := main_#t~nondet5;havoc main_#t~nondet5;main_~c2~1 := main_#t~nondet6;havoc main_#t~nondet6; 19#L25true assume !(0 != main_~c1~1 % 256); 14#L25-2true assume !(0 != main_~c2~1 % 256); 4#L26true main_~c1~1 := main_#t~nondet7;havoc main_#t~nondet7;main_~c2~1 := main_#t~nondet8;havoc main_#t~nondet8; 7#L28true assume !(0 != main_~c1~1 % 256); 6#L28-1true assume !(0 != main_~c2~1 % 256); 9#L30-1true [2018-11-23 07:26:07,799 INFO L796 eck$LassoCheckResult]: Loop: 9#L30-1true assume !!(main_~x~0 > 0);main_~x~0 := main_~x~0 - main_~d~0; 9#L30-1true [2018-11-23 07:26:07,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:26:07,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1481824371, now seen corresponding path program 1 times [2018-11-23 07:26:07,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:26:07,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:26:07,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:07,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:26:07,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:07,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:26:07,878 INFO L82 PathProgramCache]: Analyzing trace with hash 94, now seen corresponding path program 1 times [2018-11-23 07:26:07,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:26:07,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:26:07,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:07,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:26:07,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:07,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:26:07,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1308084818, now seen corresponding path program 1 times [2018-11-23 07:26:07,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:26:07,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:26:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:07,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:26:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:08,000 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:26:08,001 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:26:08,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:26:08,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:26:08,001 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:26:08,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:26:08,002 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:26:08,002 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:26:08,002 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex04_true-unreach-call_false-termination.i_Iteration1_Lasso [2018-11-23 07:26:08,002 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:26:08,002 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:26:08,015 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:26:08,020 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:26:08,026 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:26:08,028 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:26:08,033 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:26:08,038 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:26:08,040 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:26:08,051 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:26:08,052 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:26:08,148 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:26:08,148 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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:26:08,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:26:08,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:26:08,165 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:26:08,165 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c1~1=0} Honda state: {ULTIMATE.start_main_~c1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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:26:08,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:26:08,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:26:08,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:26:08,186 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c2~1=0} Honda state: {ULTIMATE.start_main_~c2~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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:26:08,203 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:26:08,203 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:26:08,207 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:26:08,208 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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:26:08,232 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:26:08,232 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:26:08,234 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:26:08,234 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:26:08,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:26:08,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:26:08,251 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:26:08,251 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet6=0} Honda state: {ULTIMATE.start_main_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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:26:08,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:26:08,276 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:26:08,278 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:26:08,278 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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:26:08,293 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:26:08,293 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/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:26:08,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:26:08,311 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:26:14,399 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:26:14,402 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:26:14,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:26:14,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:26:14,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:26:14,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:26:14,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:26:14,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:26:14,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:26:14,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex04_true-unreach-call_false-termination.i_Iteration1_Lasso [2018-11-23 07:26:14,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:26:14,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:26:14,404 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:26:14,406 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:26:14,408 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:26:14,417 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:26:14,419 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:26:14,424 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:26:14,426 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:26:14,427 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:26:14,428 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:26:14,542 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:26:14,547 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:26:14,548 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:26:14,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:26:14,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:26:14,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:26:14,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:26:14,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:26:14,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:26:14,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:26:14,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:26:14,556 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:26:14,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:26:14,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:26:14,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:26:14,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:26:14,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:26:14,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:26:14,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:26:14,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:26:14,558 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:26:14,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:26:14,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:26:14,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:26:14,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:26:14,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:26:14,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:26:14,591 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:26:14,602 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 07:26:14,602 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:26:14,604 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:26:14,606 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 07:26:14,606 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:26:14,607 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [1*ULTIMATE.start_main_~d~0 - 1 >= 0] [2018-11-23 07:26:14,610 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 07:26:14,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:26:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:26:14,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:26:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:26:14,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:26:14,689 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:26:14,702 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-23 07:26:14,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-11-23 07:26:14,794 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 61 states and 89 transitions. Complement of second has 8 states. [2018-11-23 07:26:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-23 07:26:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:26:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 07:26:14,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-23 07:26:14,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:26:14,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 8 letters. Loop has 1 letters. [2018-11-23 07:26:14,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:26:14,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 07:26:14,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:26:14,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 89 transitions. [2018-11-23 07:26:14,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-23 07:26:14,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 23 states and 37 transitions. [2018-11-23 07:26:14,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 07:26:14,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 07:26:14,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 37 transitions. [2018-11-23 07:26:14,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:26:14,807 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 37 transitions. [2018-11-23 07:26:14,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 37 transitions. [2018-11-23 07:26:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-23 07:26:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 07:26:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-11-23 07:26:14,825 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 34 transitions. [2018-11-23 07:26:14,826 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 34 transitions. [2018-11-23 07:26:14,826 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:26:14,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 34 transitions. [2018-11-23 07:26:14,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 07:26:14,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:26:14,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:26:14,827 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:26:14,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 07:26:14,828 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1;main_~d~0 := 1;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 150#L23 assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000);main_~c1~1 := main_#t~nondet5;havoc main_#t~nondet5;main_~c2~1 := main_#t~nondet6;havoc main_#t~nondet6; 154#L25 assume 0 != main_~c1~1 % 256;main_~d~0 := main_~d~0 - 1; 155#L25-2 assume !(0 != main_~c2~1 % 256); 147#L26 main_~c1~1 := main_#t~nondet7;havoc main_#t~nondet7;main_~c2~1 := main_#t~nondet8;havoc main_#t~nondet8; 148#L28 assume !(0 != main_~c1~1 % 256); 146#L28-1 assume !(0 != main_~c2~1 % 256); 152#L30-1 [2018-11-23 07:26:14,828 INFO L796 eck$LassoCheckResult]: Loop: 152#L30-1 assume !!(main_~x~0 > 0);main_~x~0 := main_~x~0 - main_~d~0; 152#L30-1 [2018-11-23 07:26:14,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:26:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1483671413, now seen corresponding path program 1 times [2018-11-23 07:26:14,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:26:14,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:26:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:14,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:26:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:14,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:26:14,841 INFO L82 PathProgramCache]: Analyzing trace with hash 94, now seen corresponding path program 2 times [2018-11-23 07:26:14,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:26:14,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:26:14,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:14,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:26:14,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:14,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:26:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1250826516, now seen corresponding path program 1 times [2018-11-23 07:26:14,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:26:14,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:26:14,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:14,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:26:14,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:26:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:26:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1;main_~d~0 := 1;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000);main_~c1~1 := main_#t~nondet5;havoc main_#t~nondet5;main_~c2~1 := main_#t~nondet6;havoc main_#t~nondet6; [?] assume 0 != main_~c1~1 % 256;main_~d~0 := main_~d~0 - 1; [?] assume !(0 != main_~c2~1 % 256); [?] main_~c1~1 := main_#t~nondet7;havoc main_#t~nondet7;main_~c2~1 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(0 != main_~c1~1 % 256); [?] assume !(0 != main_~c2~1 % 256); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000); [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] assume 0 != main_~c1~1 % 256; [L25] main_~d~0 := main_~d~0 - 1; [L26] assume !(0 != main_~c2~1 % 256); [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] assume !(0 != main_~c1~1 % 256); [L29] assume !(0 != main_~c2~1 % 256); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000); [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] assume 0 != main_~c1~1 % 256; [L25] main_~d~0 := main_~d~0 - 1; [L26] assume !(0 != main_~c2~1 % 256); [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] assume !(0 != main_~c1~1 % 256); [L29] assume !(0 != main_~c2~1 % 256); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] COND FALSE !(!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000)) [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] COND TRUE 0 != main_~c1~1 % 256 [L25] main_~d~0 := main_~d~0 - 1; [L26] COND FALSE !(0 != main_~c2~1 % 256) [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] COND FALSE !(0 != main_~c1~1 % 256) [L29] COND FALSE !(0 != main_~c2~1 % 256) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] COND FALSE !(!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000)) [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] COND TRUE 0 != main_~c1~1 % 256 [L25] main_~d~0 := main_~d~0 - 1; [L26] COND FALSE !(0 != main_~c2~1 % 256) [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] COND FALSE !(0 != main_~c1~1 % 256) [L29] COND FALSE !(0 != main_~c2~1 % 256) [L21] ~d~0 := 1; [L22] ~x~0 := #t~nondet4; [L22] havoc #t~nondet4; [L23] COND FALSE !(!(~x~0 <= 1000000 && ~x~0 >= -1000000)) [L24] ~c1~1 := #t~nondet5; [L24] havoc #t~nondet5; [L24] ~c2~1 := #t~nondet6; [L24] havoc #t~nondet6; [L25] COND TRUE 0 != ~c1~1 % 256 [L25] ~d~0 := ~d~0 - 1; [L26] COND FALSE !(0 != ~c2~1 % 256) [L27] ~c1~1 := #t~nondet7; [L27] havoc #t~nondet7; [L27] ~c2~1 := #t~nondet8; [L27] havoc #t~nondet8; [L28] COND FALSE !(0 != ~c1~1 % 256) [L29] COND FALSE !(0 != ~c2~1 % 256) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L21] ~d~0 := 1; [L22] ~x~0 := #t~nondet4; [L22] havoc #t~nondet4; [L23] COND FALSE !(!(~x~0 <= 1000000 && ~x~0 >= -1000000)) [L24] ~c1~1 := #t~nondet5; [L24] havoc #t~nondet5; [L24] ~c2~1 := #t~nondet6; [L24] havoc #t~nondet6; [L25] COND TRUE 0 != ~c1~1 % 256 [L25] ~d~0 := ~d~0 - 1; [L26] COND FALSE !(0 != ~c2~1 % 256) [L27] ~c1~1 := #t~nondet7; [L27] havoc #t~nondet7; [L27] ~c2~1 := #t~nondet8; [L27] havoc #t~nondet8; [L28] COND FALSE !(0 != ~c1~1 % 256) [L29] COND FALSE !(0 != ~c2~1 % 256) [L21] int d = 1; [L22] int x = __VERIFIER_nondet_int(); [L23] COND FALSE !(!(x <= 1000000 && x >= -1000000)) [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L25] COND TRUE \read(c1) [L25] d = d - 1 [L26] COND FALSE !(\read(c2)) [L27] c1=__VERIFIER_nondet_bool() [L27] c2=__VERIFIER_nondet_bool() [L28] COND FALSE !(\read(c1)) [L29] COND FALSE !(\read(c2)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~x~0 > 0);main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] assume !!(main_~x~0 > 0); [L32] main_~x~0 := main_~x~0 - main_~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L30-L33] assume !!(main_~x~0 > 0); [L32] main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] COND FALSE !(!(main_~x~0 > 0)) [L32] main_~x~0 := main_~x~0 - main_~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L30-L33] COND FALSE !(!(main_~x~0 > 0)) [L32] main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] COND FALSE !(!(~x~0 > 0)) [L32] ~x~0 := ~x~0 - ~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L30-L33] COND FALSE !(!(~x~0 > 0)) [L32] ~x~0 := ~x~0 - ~d~0; [L30] COND TRUE x>0 [L32] x=x-d ----- [2018-11-23 07:26:14,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:26:14 BoogieIcfgContainer [2018-11-23 07:26:14,912 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:26:14,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:26:14,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:26:14,912 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:26:14,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:26:07" (3/4) ... [2018-11-23 07:26:14,915 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~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1;main_~d~0 := 1;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000);main_~c1~1 := main_#t~nondet5;havoc main_#t~nondet5;main_~c2~1 := main_#t~nondet6;havoc main_#t~nondet6; [?] assume 0 != main_~c1~1 % 256;main_~d~0 := main_~d~0 - 1; [?] assume !(0 != main_~c2~1 % 256); [?] main_~c1~1 := main_#t~nondet7;havoc main_#t~nondet7;main_~c2~1 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(0 != main_~c1~1 % 256); [?] assume !(0 != main_~c2~1 % 256); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000); [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] assume 0 != main_~c1~1 % 256; [L25] main_~d~0 := main_~d~0 - 1; [L26] assume !(0 != main_~c2~1 % 256); [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] assume !(0 != main_~c1~1 % 256); [L29] assume !(0 != main_~c2~1 % 256); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000); [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] assume 0 != main_~c1~1 % 256; [L25] main_~d~0 := main_~d~0 - 1; [L26] assume !(0 != main_~c2~1 % 256); [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] assume !(0 != main_~c1~1 % 256); [L29] assume !(0 != main_~c2~1 % 256); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] COND FALSE !(!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000)) [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] COND TRUE 0 != main_~c1~1 % 256 [L25] main_~d~0 := main_~d~0 - 1; [L26] COND FALSE !(0 != main_~c2~1 % 256) [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] COND FALSE !(0 != main_~c1~1 % 256) [L29] COND FALSE !(0 != main_~c2~1 % 256) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] COND FALSE !(!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000)) [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] COND TRUE 0 != main_~c1~1 % 256 [L25] main_~d~0 := main_~d~0 - 1; [L26] COND FALSE !(0 != main_~c2~1 % 256) [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] COND FALSE !(0 != main_~c1~1 % 256) [L29] COND FALSE !(0 != main_~c2~1 % 256) [L21] ~d~0 := 1; [L22] ~x~0 := #t~nondet4; [L22] havoc #t~nondet4; [L23] COND FALSE !(!(~x~0 <= 1000000 && ~x~0 >= -1000000)) [L24] ~c1~1 := #t~nondet5; [L24] havoc #t~nondet5; [L24] ~c2~1 := #t~nondet6; [L24] havoc #t~nondet6; [L25] COND TRUE 0 != ~c1~1 % 256 [L25] ~d~0 := ~d~0 - 1; [L26] COND FALSE !(0 != ~c2~1 % 256) [L27] ~c1~1 := #t~nondet7; [L27] havoc #t~nondet7; [L27] ~c2~1 := #t~nondet8; [L27] havoc #t~nondet8; [L28] COND FALSE !(0 != ~c1~1 % 256) [L29] COND FALSE !(0 != ~c2~1 % 256) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L21] ~d~0 := 1; [L22] ~x~0 := #t~nondet4; [L22] havoc #t~nondet4; [L23] COND FALSE !(!(~x~0 <= 1000000 && ~x~0 >= -1000000)) [L24] ~c1~1 := #t~nondet5; [L24] havoc #t~nondet5; [L24] ~c2~1 := #t~nondet6; [L24] havoc #t~nondet6; [L25] COND TRUE 0 != ~c1~1 % 256 [L25] ~d~0 := ~d~0 - 1; [L26] COND FALSE !(0 != ~c2~1 % 256) [L27] ~c1~1 := #t~nondet7; [L27] havoc #t~nondet7; [L27] ~c2~1 := #t~nondet8; [L27] havoc #t~nondet8; [L28] COND FALSE !(0 != ~c1~1 % 256) [L29] COND FALSE !(0 != ~c2~1 % 256) [L21] int d = 1; [L22] int x = __VERIFIER_nondet_int(); [L23] COND FALSE !(!(x <= 1000000 && x >= -1000000)) [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L25] COND TRUE \read(c1) [L25] d = d - 1 [L26] COND FALSE !(\read(c2)) [L27] c1=__VERIFIER_nondet_bool() [L27] c2=__VERIFIER_nondet_bool() [L28] COND FALSE !(\read(c1)) [L29] COND FALSE !(\read(c2)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~x~0 > 0);main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] assume !!(main_~x~0 > 0); [L32] main_~x~0 := main_~x~0 - main_~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L30-L33] assume !!(main_~x~0 > 0); [L32] main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] COND FALSE !(!(main_~x~0 > 0)) [L32] main_~x~0 := main_~x~0 - main_~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L30-L33] COND FALSE !(!(main_~x~0 > 0)) [L32] main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] COND FALSE !(!(~x~0 > 0)) [L32] ~x~0 := ~x~0 - ~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L30-L33] COND FALSE !(!(~x~0 > 0)) [L32] ~x~0 := ~x~0 - ~d~0; [L30] COND TRUE x>0 [L32] x=x-d ----- [2018-11-23 07:26:14,943 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_97d71eb2-1eff-4e23-accc-2e672c0a112a/bin-2019/uautomizer/witness.graphml [2018-11-23 07:26:14,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:26:14,944 INFO L168 Benchmark]: Toolchain (without parser) took 7604.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 958.2 MB in the beginning and 973.1 MB in the end (delta: -14.9 MB). Peak memory consumption was 126.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:26:14,945 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:26:14,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.22 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:26:14,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.32 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 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:26:14,946 INFO L168 Benchmark]: Boogie Preprocessor took 46.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:26:14,947 INFO L168 Benchmark]: RCFGBuilder took 152.07 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:26:14,948 INFO L168 Benchmark]: BuchiAutomizer took 7196.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 143.5 MB). Peak memory consumption was 143.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:26:14,948 INFO L168 Benchmark]: Witness Printer took 31.21 ms. Allocated memory is still 1.2 GB. Free memory was 975.8 MB in the beginning and 973.1 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:26:14,951 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.22 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.32 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 152.07 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7196.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 143.5 MB). Peak memory consumption was 143.5 MB. Max. memory is 11.5 GB. * Witness Printer took 31.21 ms. Allocated memory is still 1.2 GB. Free memory was 975.8 MB in the beginning and 973.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function x and consists of 6 locations. The remainder module has 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 6.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 44 SDtfs, 46 SDslu, 24 SDs, 0 SdLazy, 17 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital33 mio100 ax100 hnf93 lsp67 ukn100 mio100 lsp100 div219 bol100 ite100 ukn100 eq143 hnf43 smp100 dnf100 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 48ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 6.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@2fc6e99d=0, d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d4dc231=0, c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@119af45d=0, c1=0, \result=0, x=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70eef051=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@687c75d0=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 20]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1;main_~d~0 := 1;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000);main_~c1~1 := main_#t~nondet5;havoc main_#t~nondet5;main_~c2~1 := main_#t~nondet6;havoc main_#t~nondet6; [?] assume 0 != main_~c1~1 % 256;main_~d~0 := main_~d~0 - 1; [?] assume !(0 != main_~c2~1 % 256); [?] main_~c1~1 := main_#t~nondet7;havoc main_#t~nondet7;main_~c2~1 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(0 != main_~c1~1 % 256); [?] assume !(0 != main_~c2~1 % 256); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000); [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] assume 0 != main_~c1~1 % 256; [L25] main_~d~0 := main_~d~0 - 1; [L26] assume !(0 != main_~c2~1 % 256); [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] assume !(0 != main_~c1~1 % 256); [L29] assume !(0 != main_~c2~1 % 256); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000); [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] assume 0 != main_~c1~1 % 256; [L25] main_~d~0 := main_~d~0 - 1; [L26] assume !(0 != main_~c2~1 % 256); [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] assume !(0 != main_~c1~1 % 256); [L29] assume !(0 != main_~c2~1 % 256); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] COND FALSE !(!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000)) [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] COND TRUE 0 != main_~c1~1 % 256 [L25] main_~d~0 := main_~d~0 - 1; [L26] COND FALSE !(0 != main_~c2~1 % 256) [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] COND FALSE !(0 != main_~c1~1 % 256) [L29] COND FALSE !(0 != main_~c2~1 % 256) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] COND FALSE !(!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000)) [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] COND TRUE 0 != main_~c1~1 % 256 [L25] main_~d~0 := main_~d~0 - 1; [L26] COND FALSE !(0 != main_~c2~1 % 256) [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] COND FALSE !(0 != main_~c1~1 % 256) [L29] COND FALSE !(0 != main_~c2~1 % 256) [L21] ~d~0 := 1; [L22] ~x~0 := #t~nondet4; [L22] havoc #t~nondet4; [L23] COND FALSE !(!(~x~0 <= 1000000 && ~x~0 >= -1000000)) [L24] ~c1~1 := #t~nondet5; [L24] havoc #t~nondet5; [L24] ~c2~1 := #t~nondet6; [L24] havoc #t~nondet6; [L25] COND TRUE 0 != ~c1~1 % 256 [L25] ~d~0 := ~d~0 - 1; [L26] COND FALSE !(0 != ~c2~1 % 256) [L27] ~c1~1 := #t~nondet7; [L27] havoc #t~nondet7; [L27] ~c2~1 := #t~nondet8; [L27] havoc #t~nondet8; [L28] COND FALSE !(0 != ~c1~1 % 256) [L29] COND FALSE !(0 != ~c2~1 % 256) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L21] ~d~0 := 1; [L22] ~x~0 := #t~nondet4; [L22] havoc #t~nondet4; [L23] COND FALSE !(!(~x~0 <= 1000000 && ~x~0 >= -1000000)) [L24] ~c1~1 := #t~nondet5; [L24] havoc #t~nondet5; [L24] ~c2~1 := #t~nondet6; [L24] havoc #t~nondet6; [L25] COND TRUE 0 != ~c1~1 % 256 [L25] ~d~0 := ~d~0 - 1; [L26] COND FALSE !(0 != ~c2~1 % 256) [L27] ~c1~1 := #t~nondet7; [L27] havoc #t~nondet7; [L27] ~c2~1 := #t~nondet8; [L27] havoc #t~nondet8; [L28] COND FALSE !(0 != ~c1~1 % 256) [L29] COND FALSE !(0 != ~c2~1 % 256) [L21] int d = 1; [L22] int x = __VERIFIER_nondet_int(); [L23] COND FALSE !(!(x <= 1000000 && x >= -1000000)) [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L25] COND TRUE \read(c1) [L25] d = d - 1 [L26] COND FALSE !(\read(c2)) [L27] c1=__VERIFIER_nondet_bool() [L27] c2=__VERIFIER_nondet_bool() [L28] COND FALSE !(\read(c1)) [L29] COND FALSE !(\read(c2)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~x~0 > 0);main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] assume !!(main_~x~0 > 0); [L32] main_~x~0 := main_~x~0 - main_~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L30-L33] assume !!(main_~x~0 > 0); [L32] main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] COND FALSE !(!(main_~x~0 > 0)) [L32] main_~x~0 := main_~x~0 - main_~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L30-L33] COND FALSE !(!(main_~x~0 > 0)) [L32] main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] COND FALSE !(!(~x~0 > 0)) [L32] ~x~0 := ~x~0 - ~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L30-L33] COND FALSE !(!(~x~0 > 0)) [L32] ~x~0 := ~x~0 - ~d~0; [L30] COND TRUE x>0 [L32] x=x-d ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1;main_~d~0 := 1;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000);main_~c1~1 := main_#t~nondet5;havoc main_#t~nondet5;main_~c2~1 := main_#t~nondet6;havoc main_#t~nondet6; [?] assume 0 != main_~c1~1 % 256;main_~d~0 := main_~d~0 - 1; [?] assume !(0 != main_~c2~1 % 256); [?] main_~c1~1 := main_#t~nondet7;havoc main_#t~nondet7;main_~c2~1 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(0 != main_~c1~1 % 256); [?] assume !(0 != main_~c2~1 % 256); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000); [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] assume 0 != main_~c1~1 % 256; [L25] main_~d~0 := main_~d~0 - 1; [L26] assume !(0 != main_~c2~1 % 256); [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] assume !(0 != main_~c1~1 % 256); [L29] assume !(0 != main_~c2~1 % 256); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] assume !!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000); [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] assume 0 != main_~c1~1 % 256; [L25] main_~d~0 := main_~d~0 - 1; [L26] assume !(0 != main_~c2~1 % 256); [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] assume !(0 != main_~c1~1 % 256); [L29] assume !(0 != main_~c2~1 % 256); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] COND FALSE !(!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000)) [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] COND TRUE 0 != main_~c1~1 % 256 [L25] main_~d~0 := main_~d~0 - 1; [L26] COND FALSE !(0 != main_~c2~1 % 256) [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] COND FALSE !(0 != main_~c1~1 % 256) [L29] COND FALSE !(0 != main_~c2~1 % 256) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~x~0, main_~c1~1, main_~c2~1; [L21] main_~d~0 := 1; [L22] main_~x~0 := main_#t~nondet4; [L22] havoc main_#t~nondet4; [L23] COND FALSE !(!(main_~x~0 <= 1000000 && main_~x~0 >= -1000000)) [L24] main_~c1~1 := main_#t~nondet5; [L24] havoc main_#t~nondet5; [L24] main_~c2~1 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] COND TRUE 0 != main_~c1~1 % 256 [L25] main_~d~0 := main_~d~0 - 1; [L26] COND FALSE !(0 != main_~c2~1 % 256) [L27] main_~c1~1 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L27] main_~c2~1 := main_#t~nondet8; [L27] havoc main_#t~nondet8; [L28] COND FALSE !(0 != main_~c1~1 % 256) [L29] COND FALSE !(0 != main_~c2~1 % 256) [L21] ~d~0 := 1; [L22] ~x~0 := #t~nondet4; [L22] havoc #t~nondet4; [L23] COND FALSE !(!(~x~0 <= 1000000 && ~x~0 >= -1000000)) [L24] ~c1~1 := #t~nondet5; [L24] havoc #t~nondet5; [L24] ~c2~1 := #t~nondet6; [L24] havoc #t~nondet6; [L25] COND TRUE 0 != ~c1~1 % 256 [L25] ~d~0 := ~d~0 - 1; [L26] COND FALSE !(0 != ~c2~1 % 256) [L27] ~c1~1 := #t~nondet7; [L27] havoc #t~nondet7; [L27] ~c2~1 := #t~nondet8; [L27] havoc #t~nondet8; [L28] COND FALSE !(0 != ~c1~1 % 256) [L29] COND FALSE !(0 != ~c2~1 % 256) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L21] ~d~0 := 1; [L22] ~x~0 := #t~nondet4; [L22] havoc #t~nondet4; [L23] COND FALSE !(!(~x~0 <= 1000000 && ~x~0 >= -1000000)) [L24] ~c1~1 := #t~nondet5; [L24] havoc #t~nondet5; [L24] ~c2~1 := #t~nondet6; [L24] havoc #t~nondet6; [L25] COND TRUE 0 != ~c1~1 % 256 [L25] ~d~0 := ~d~0 - 1; [L26] COND FALSE !(0 != ~c2~1 % 256) [L27] ~c1~1 := #t~nondet7; [L27] havoc #t~nondet7; [L27] ~c2~1 := #t~nondet8; [L27] havoc #t~nondet8; [L28] COND FALSE !(0 != ~c1~1 % 256) [L29] COND FALSE !(0 != ~c2~1 % 256) [L21] int d = 1; [L22] int x = __VERIFIER_nondet_int(); [L23] COND FALSE !(!(x <= 1000000 && x >= -1000000)) [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L25] COND TRUE \read(c1) [L25] d = d - 1 [L26] COND FALSE !(\read(c2)) [L27] c1=__VERIFIER_nondet_bool() [L27] c2=__VERIFIER_nondet_bool() [L28] COND FALSE !(\read(c1)) [L29] COND FALSE !(\read(c2)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~x~0 > 0);main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] assume !!(main_~x~0 > 0); [L32] main_~x~0 := main_~x~0 - main_~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L30-L33] assume !!(main_~x~0 > 0); [L32] main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] COND FALSE !(!(main_~x~0 > 0)) [L32] main_~x~0 := main_~x~0 - main_~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L30-L33] COND FALSE !(!(main_~x~0 > 0)) [L32] main_~x~0 := main_~x~0 - main_~d~0; [L30-L33] COND FALSE !(!(~x~0 > 0)) [L32] ~x~0 := ~x~0 - ~d~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L30-L33] COND FALSE !(!(~x~0 > 0)) [L32] ~x~0 := ~x~0 - ~d~0; [L30] COND TRUE x>0 [L32] x=x-d ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L21] int d = 1; [L22] int x = __VERIFIER_nondet_int(); [L23] COND FALSE !(!(x <= 1000000 && x >= -1000000)) [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L24] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L25] COND TRUE \read(c1) [L25] d = d - 1 [L26] COND FALSE !(\read(c2)) [L27] c1=__VERIFIER_nondet_bool() [L27] c2=__VERIFIER_nondet_bool() [L28] COND FALSE !(\read(c1)) [L29] COND FALSE !(\read(c2)) Loop: [L30] COND TRUE x>0 [L32] x=x-d End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...