./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/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 908d5a30c025a627bef25d9bbdeea2e3c6386523 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 18:43:51,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:43:51,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:43:51,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:43:51,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:43:51,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:43:51,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:43:51,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:43:51,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:43:51,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:43:51,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:43:51,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:43:51,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:43:51,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:43:51,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:43:51,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:43:51,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:43:51,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:43:51,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:43:51,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:43:51,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:43:51,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:43:51,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:43:51,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:43:51,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:43:51,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:43:51,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:43:51,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:43:51,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:43:51,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:43:51,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:43:51,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:43:51,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:43:51,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:43:51,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:43:51,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:43:51,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:43:51,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:43:51,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:43:51,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:43:51,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:43:52,000 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 18:43:52,055 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:43:52,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:43:52,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:43:52,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:43:52,059 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:43:52,059 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 18:43:52,059 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 18:43:52,060 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 18:43:52,060 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 18:43:52,060 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 18:43:52,062 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 18:43:52,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:43:52,063 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:43:52,063 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 18:43:52,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:43:52,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:43:52,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:43:52,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 18:43:52,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 18:43:52,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 18:43:52,065 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:43:52,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:43:52,065 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 18:43:52,066 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:43:52,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 18:43:52,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:43:52,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:43:52,067 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 18:43:52,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:43:52,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 18:43:52,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:43:52,068 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 18:43:52,070 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 18:43:52,070 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/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 -> 908d5a30c025a627bef25d9bbdeea2e3c6386523 [2020-11-29 18:43:52,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:43:52,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:43:52,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:43:52,504 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:43:52,505 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:43:52,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2020-11-29 18:43:52,606 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/data/d87c1ffd9/75b2024a028f40db95a95a352729c73b/FLAG5c1f4a5bd [2020-11-29 18:43:53,338 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:43:53,339 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2020-11-29 18:43:53,351 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/data/d87c1ffd9/75b2024a028f40db95a95a352729c73b/FLAG5c1f4a5bd [2020-11-29 18:43:53,656 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/data/d87c1ffd9/75b2024a028f40db95a95a352729c73b [2020-11-29 18:43:53,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:43:53,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:43:53,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:43:53,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:43:53,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:43:53,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:43:53" (1/1) ... [2020-11-29 18:43:53,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4779f0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:53, skipping insertion in model container [2020-11-29 18:43:53,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:43:53" (1/1) ... [2020-11-29 18:43:53,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:43:53,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:43:54,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:43:54,093 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:43:54,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:43:54,174 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:43:54,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54 WrapperNode [2020-11-29 18:43:54,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:43:54,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:43:54,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:43:54,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:43:54,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... [2020-11-29 18:43:54,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... [2020-11-29 18:43:54,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:43:54,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:43:54,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:43:54,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:43:54,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... [2020-11-29 18:43:54,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... [2020-11-29 18:43:54,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... [2020-11-29 18:43:54,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... [2020-11-29 18:43:54,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... [2020-11-29 18:43:54,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... [2020-11-29 18:43:54,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... [2020-11-29 18:43:54,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:43:54,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:43:54,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:43:54,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:43:54,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/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 [2020-11-29 18:43:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:43:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:43:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:43:54,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:43:55,376 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:43:55,377 INFO L298 CfgBuilder]: Removed 21 assume(true) statements. [2020-11-29 18:43:55,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:43:55 BoogieIcfgContainer [2020-11-29 18:43:55,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:43:55,381 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 18:43:55,381 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 18:43:55,389 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 18:43:55,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 18:43:55,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 06:43:53" (1/3) ... [2020-11-29 18:43:55,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c042878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:43:55, skipping insertion in model container [2020-11-29 18:43:55,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 18:43:55,401 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:54" (2/3) ... [2020-11-29 18:43:55,401 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c042878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:43:55, skipping insertion in model container [2020-11-29 18:43:55,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 18:43:55,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:43:55" (3/3) ... [2020-11-29 18:43:55,404 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c [2020-11-29 18:43:55,487 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 18:43:55,487 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 18:43:55,488 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 18:43:55,488 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:43:55,488 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:43:55,488 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 18:43:55,488 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:43:55,488 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 18:43:55,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2020-11-29 18:43:55,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-11-29 18:43:55,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:43:55,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:43:55,548 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:55,548 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:55,548 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 18:43:55,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2020-11-29 18:43:55,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-11-29 18:43:55,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:43:55,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:43:55,559 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:55,559 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:55,567 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 11#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 37#L161true assume !(0 == ~r1~0);init_~tmp~0 := 0; 34#L161-1true init_#res := init_~tmp~0; 47#L254true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 7#L310true assume !(0 == main_~i2~0); 70#L310-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 50#L320-2true [2020-11-29 18:43:55,569 INFO L796 eck$LassoCheckResult]: Loop: 50#L320-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 66#L61true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 18#L65true assume !(node1_~m1~0 != ~nomsg~0); 15#L65-1true ~mode1~0 := 0; 62#L61-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 20#L87true assume !(0 != ~mode2~0 % 256); 58#L100true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 56#L100-2true ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 14#L87-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 61#L112true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 46#L115true assume !(node3_~m3~0 != ~nomsg~0); 45#L115-1true ~mode3~0 := 0; 78#L112-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 49#L137true assume !(0 != ~mode4~0 % 256); 36#L150true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 10#L150-2true ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 44#L137-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 63#L262true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 60#L262-1true check_#res := check_~tmp~1; 26#L282true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 21#L347true assume !(0 == assert_~arg % 256); 67#L342true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 50#L320-2true [2020-11-29 18:43:55,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:43:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2020-11-29 18:43:55,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:43:55,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991487599] [2020-11-29 18:43:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:43:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:55,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991487599] [2020-11-29 18:43:55,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:43:55,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:43:55,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731251832] [2020-11-29 18:43:55,892 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:43:55,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:43:55,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1219507487, now seen corresponding path program 1 times [2020-11-29 18:43:55,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:43:55,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839000297] [2020-11-29 18:43:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:43:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:56,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839000297] [2020-11-29 18:43:56,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:43:56,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:43:56,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107476198] [2020-11-29 18:43:56,117 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:43:56,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:43:56,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:43:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:43:56,140 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 5 states. [2020-11-29 18:43:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:43:56,351 INFO L93 Difference]: Finished difference Result 122 states and 194 transitions. [2020-11-29 18:43:56,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:43:56,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 194 transitions. [2020-11-29 18:43:56,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-11-29 18:43:56,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 113 states and 163 transitions. [2020-11-29 18:43:56,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2020-11-29 18:43:56,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2020-11-29 18:43:56,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 163 transitions. [2020-11-29 18:43:56,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:43:56,417 INFO L691 BuchiCegarLoop]: Abstraction has 113 states and 163 transitions. [2020-11-29 18:43:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 163 transitions. [2020-11-29 18:43:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2020-11-29 18:43:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-29 18:43:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2020-11-29 18:43:56,476 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2020-11-29 18:43:56,476 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2020-11-29 18:43:56,477 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 18:43:56,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2020-11-29 18:43:56,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-11-29 18:43:56,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:43:56,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:43:56,487 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:56,487 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:56,495 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 235#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 236#L161 assume 0 == ~r1~0; 267#L162 assume ~id1~0 >= 0; 283#L163 assume 0 == ~st1~0; 252#L164 assume ~send1~0 == ~id1~0; 253#L165 assume 0 == ~mode1~0 % 256; 256#L166 assume ~id2~0 >= 0; 271#L167 assume 0 == ~st2~0; 229#L168 assume ~send2~0 == ~id2~0; 230#L169 assume 0 == ~mode2~0 % 256; 261#L170 assume ~id3~0 >= 0; 241#L171 assume 0 == ~st3~0; 242#L172 assume ~send3~0 == ~id3~0; 268#L173 assume 0 == ~mode3~0 % 256; 285#L174 assume ~id4~0 >= 0; 217#L175 assume 0 == ~st4~0; 218#L176 assume ~send4~0 == ~id4~0; 257#L177 assume 0 == ~mode4~0 % 256; 272#L178 assume ~id1~0 != ~id2~0; 231#L179 assume ~id1~0 != ~id3~0; 232#L180 assume ~id1~0 != ~id4~0; 262#L181 assume ~id2~0 != ~id3~0; 243#L182 assume ~id2~0 != ~id4~0; 244#L183 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 264#L161-1 init_#res := init_~tmp~0; 265#L254 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 227#L310 assume !(0 == main_~i2~0); 228#L310-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 280#L320-2 [2020-11-29 18:43:56,496 INFO L796 eck$LassoCheckResult]: Loop: 280#L320-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 281#L61 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 245#L65 assume !(node1_~m1~0 != ~nomsg~0); 220#L65-1 ~mode1~0 := 0; 240#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 247#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 248#L90 assume !(node2_~m2~0 != ~nomsg~0); 222#L90-1 ~mode2~0 := 0; 238#L87-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 239#L112 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 275#L115 assume !(node3_~m3~0 != ~nomsg~0); 274#L115-1 ~mode3~0 := 0; 259#L112-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 278#L137 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 279#L140 assume !(node4_~m4~0 != ~nomsg~0); 270#L140-1 ~mode4~0 := 0; 234#L137-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 273#L262 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 237#L262-1 check_#res := check_~tmp~1; 255#L282 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 250#L347 assume !(0 == assert_~arg % 256); 251#L342 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 280#L320-2 [2020-11-29 18:43:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:43:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2020-11-29 18:43:56,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:43:56,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084500430] [2020-11-29 18:43:56,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:43:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:43:56,578 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:43:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:43:56,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:43:56,718 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:43:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:43:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash -843208203, now seen corresponding path program 1 times [2020-11-29 18:43:56,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:43:56,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229549406] [2020-11-29 18:43:56,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:43:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:56,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229549406] [2020-11-29 18:43:56,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:43:56,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:43:56,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327201281] [2020-11-29 18:43:56,899 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:43:56,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:43:56,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:43:56,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:43:56,901 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. cyclomatic complexity: 26 Second operand 5 states. [2020-11-29 18:43:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:43:56,986 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2020-11-29 18:43:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:43:56,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2020-11-29 18:43:56,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-11-29 18:43:56,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2020-11-29 18:43:56,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2020-11-29 18:43:56,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-11-29 18:43:56,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2020-11-29 18:43:56,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:43:56,993 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-11-29 18:43:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2020-11-29 18:43:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-11-29 18:43:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-29 18:43:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2020-11-29 18:43:57,000 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-11-29 18:43:57,000 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-11-29 18:43:57,000 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 18:43:57,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2020-11-29 18:43:57,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-11-29 18:43:57,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:43:57,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:43:57,004 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:57,004 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:57,004 INFO L794 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 392#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 393#L161 assume 0 == ~r1~0; 424#L162 assume ~id1~0 >= 0; 440#L163 assume 0 == ~st1~0; 408#L164 assume ~send1~0 == ~id1~0; 409#L165 assume 0 == ~mode1~0 % 256; 413#L166 assume ~id2~0 >= 0; 428#L167 assume 0 == ~st2~0; 386#L168 assume ~send2~0 == ~id2~0; 387#L169 assume 0 == ~mode2~0 % 256; 418#L170 assume ~id3~0 >= 0; 397#L171 assume 0 == ~st3~0; 398#L172 assume ~send3~0 == ~id3~0; 425#L173 assume 0 == ~mode3~0 % 256; 442#L174 assume ~id4~0 >= 0; 374#L175 assume 0 == ~st4~0; 375#L176 assume ~send4~0 == ~id4~0; 414#L177 assume 0 == ~mode4~0 % 256; 429#L178 assume ~id1~0 != ~id2~0; 388#L179 assume ~id1~0 != ~id3~0; 389#L180 assume ~id1~0 != ~id4~0; 419#L181 assume ~id2~0 != ~id3~0; 399#L182 assume ~id2~0 != ~id4~0; 400#L183 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 421#L161-1 init_#res := init_~tmp~0; 422#L254 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 384#L310 assume !(0 == main_~i2~0); 385#L310-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 437#L320-2 [2020-11-29 18:43:57,005 INFO L796 eck$LassoCheckResult]: Loop: 437#L320-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 438#L61 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 401#L65 assume !(node1_~m1~0 != ~nomsg~0); 377#L65-1 ~mode1~0 := 0; 396#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 403#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 404#L90 assume !(node2_~m2~0 != ~nomsg~0); 379#L90-1 ~mode2~0 := 0; 394#L87-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 395#L112 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 432#L115 assume !(node3_~m3~0 != ~nomsg~0); 431#L115-1 ~mode3~0 := 0; 416#L112-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 435#L137 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 436#L140 assume !(node4_~m4~0 != ~nomsg~0); 427#L140-1 ~mode4~0 := 0; 391#L137-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 430#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 381#L263 assume ~r1~0 >= 4; 382#L267 assume ~r1~0 < 4;check_~tmp~1 := 1; 411#L262-1 check_#res := check_~tmp~1; 412#L282 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 406#L347 assume !(0 == assert_~arg % 256); 407#L342 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 437#L320-2 [2020-11-29 18:43:57,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:43:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2020-11-29 18:43:57,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:43:57,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192433770] [2020-11-29 18:43:57,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:43:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:43:57,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:43:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:43:57,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:43:57,072 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:43:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:43:57,073 INFO L82 PathProgramCache]: Analyzing trace with hash 9853189, now seen corresponding path program 1 times [2020-11-29 18:43:57,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:43:57,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116812841] [2020-11-29 18:43:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:43:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:57,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116812841] [2020-11-29 18:43:57,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:43:57,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:43:57,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334102458] [2020-11-29 18:43:57,124 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:43:57,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:43:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:43:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:43:57,126 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-11-29 18:43:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:43:57,165 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2020-11-29 18:43:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:43:57,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2020-11-29 18:43:57,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-11-29 18:43:57,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2020-11-29 18:43:57,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2020-11-29 18:43:57,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2020-11-29 18:43:57,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2020-11-29 18:43:57,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:43:57,172 INFO L691 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2020-11-29 18:43:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2020-11-29 18:43:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-29 18:43:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-29 18:43:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2020-11-29 18:43:57,181 INFO L714 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2020-11-29 18:43:57,181 INFO L594 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2020-11-29 18:43:57,181 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 18:43:57,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2020-11-29 18:43:57,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-11-29 18:43:57,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:43:57,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:43:57,185 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:57,185 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:43:57,185 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 575#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 576#L161 assume 0 == ~r1~0; 610#L162 assume ~id1~0 >= 0; 627#L163 assume 0 == ~st1~0; 593#L164 assume ~send1~0 == ~id1~0; 594#L165 assume 0 == ~mode1~0 % 256; 598#L166 assume ~id2~0 >= 0; 614#L167 assume 0 == ~st2~0; 569#L168 assume ~send2~0 == ~id2~0; 570#L169 assume 0 == ~mode2~0 % 256; 604#L170 assume ~id3~0 >= 0; 582#L171 assume 0 == ~st3~0; 583#L172 assume ~send3~0 == ~id3~0; 611#L173 assume 0 == ~mode3~0 % 256; 628#L174 assume ~id4~0 >= 0; 558#L175 assume 0 == ~st4~0; 559#L176 assume ~send4~0 == ~id4~0; 599#L177 assume 0 == ~mode4~0 % 256; 615#L178 assume ~id1~0 != ~id2~0; 571#L179 assume ~id1~0 != ~id3~0; 572#L180 assume ~id1~0 != ~id4~0; 605#L181 assume ~id2~0 != ~id3~0; 584#L182 assume ~id2~0 != ~id4~0; 585#L183 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 607#L161-1 init_#res := init_~tmp~0; 608#L254 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 567#L310 assume !(0 == main_~i2~0); 568#L310-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 623#L320-2 [2020-11-29 18:43:57,186 INFO L796 eck$LassoCheckResult]: Loop: 623#L320-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 624#L61 assume !(0 != ~mode1~0 % 256); 631#L75 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 620#L75-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 581#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 588#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 589#L90 assume !(node2_~m2~0 != ~nomsg~0); 563#L90-1 ~mode2~0 := 0; 579#L87-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 580#L112 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 630#L115 assume !(node3_~m3~0 != ~nomsg~0); 644#L115-1 ~mode3~0 := 0; 643#L112-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 642#L137 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 640#L140 assume !(node4_~m4~0 != ~nomsg~0); 637#L140-1 ~mode4~0 := 0; 635#L137-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 634#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 633#L263 assume !(~r1~0 >= 4); 577#L266 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 578#L267 assume ~r1~0 < 4;check_~tmp~1 := 1; 629#L262-1 check_#res := check_~tmp~1; 597#L282 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 591#L347 assume !(0 == assert_~arg % 256); 592#L342 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 623#L320-2 [2020-11-29 18:43:57,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:43:57,187 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2020-11-29 18:43:57,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:43:57,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842278540] [2020-11-29 18:43:57,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:43:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:43:57,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:43:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:43:57,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:43:57,271 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:43:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:43:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash -427336859, now seen corresponding path program 1 times [2020-11-29 18:43:57,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:43:57,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610869987] [2020-11-29 18:43:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:43:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:43:57,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:43:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:43:57,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:43:57,346 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:43:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:43:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1385446977, now seen corresponding path program 1 times [2020-11-29 18:43:57,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:43:57,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418357829] [2020-11-29 18:43:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:43:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:57,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418357829] [2020-11-29 18:43:57,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:43:57,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:43:57,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623244899] [2020-11-29 18:43:58,046 WARN L193 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-11-29 18:43:58,555 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 102 [2020-11-29 18:43:58,569 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 18:43:58,570 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 18:43:58,570 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 18:43:58,571 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 18:43:58,571 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-29 18:43:58,571 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:43:58,571 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 18:43:58,572 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 18:43:58,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2020-11-29 18:43:58,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 18:43:58,572 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 18:43:58,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,875 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-11-29 18:43:58,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:58,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:43:59,312 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-11-29 18:44:00,986 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2020-11-29 18:44:01,094 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 18:44:01,095 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/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 [2020-11-29 18:44:01,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 18:44:01,132 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/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 [2020-11-29 18:44:01,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-29 18:44:01,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-29 18:44:01,247 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-29 18:44:01,250 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 18:44:01,250 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 18:44:01,250 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 18:44:01,250 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 18:44:01,251 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 18:44:01,251 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:44:01,251 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 18:44:01,251 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 18:44:01,251 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2020-11-29 18:44:01,251 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 18:44:01,251 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 18:44:01,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,471 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-11-29 18:44:01,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:44:01,904 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-11-29 18:44:03,867 WARN L193 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2020-11-29 18:44:04,013 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 18:44:04,024 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 18:44:04,036 INFO L120 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 [2020-11-29 18:44:04,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:44:04,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:44:04,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:44:04,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:44:04,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:44:04,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:44:04,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:44:04,049 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 18:44:04,134 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-29 18:44:04,134 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10212cc6-e63b-4d26-8216-b1403bfb17cd/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 18:44:04,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 18:44:04,235 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-29 18:44:04,236 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 18:44:04,237 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:44:04,284 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-29 18:44:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:44:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:44:04,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 18:44:04,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:44:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:44:04,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 18:44:04,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:44:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:44:04,623 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 [2020-11-29 18:44:04,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40 Second operand 3 states. [2020-11-29 18:44:04,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40. Second operand 3 states. Result 184 states and 263 transitions. Complement of second has 4 states. [2020-11-29 18:44:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 18:44:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 18:44:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-11-29 18:44:04,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 25 letters. [2020-11-29 18:44:04,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:44:04,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 54 letters. Loop has 25 letters. [2020-11-29 18:44:04,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:44:04,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 50 letters. [2020-11-29 18:44:04,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:44:04,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 263 transitions. [2020-11-29 18:44:04,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 18:44:04,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. [2020-11-29 18:44:04,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 18:44:04,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 18:44:04,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 18:44:04,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:44:04,736 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 18:44:04,736 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 18:44:04,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:44:04,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:44:04,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:44:04,739 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-11-29 18:44:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:44:04,740 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-11-29 18:44:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 18:44:04,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-11-29 18:44:04,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 18:44:04,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 18:44:04,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 18:44:04,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 18:44:04,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 18:44:04,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:44:04,742 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 18:44:04,742 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 18:44:04,742 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 18:44:04,746 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 18:44:04,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 18:44:04,747 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 18:44:04,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 18:44:04,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 06:44:04 BoogieIcfgContainer [2020-11-29 18:44:04,754 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 18:44:04,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:44:04,755 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:44:04,755 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:44:04,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:43:55" (3/4) ... [2020-11-29 18:44:04,760 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 18:44:04,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:44:04,765 INFO L168 Benchmark]: Toolchain (without parser) took 11101.43 ms. Allocated memory was 123.7 MB in the beginning and 218.1 MB in the end (delta: 94.4 MB). Free memory was 96.8 MB in the beginning and 133.7 MB in the end (delta: -36.9 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:44:04,766 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 86.0 MB. Free memory is still 44.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:44:04,775 INFO L168 Benchmark]: CACSL2BoogieTranslator took 497.11 ms. Allocated memory is still 123.7 MB. Free memory was 96.5 MB in the beginning and 98.0 MB in the end (delta: -1.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:44:04,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.77 ms. Allocated memory is still 123.7 MB. Free memory was 97.7 MB in the beginning and 95.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:44:04,776 INFO L168 Benchmark]: Boogie Preprocessor took 100.18 ms. Allocated memory is still 123.7 MB. Free memory was 95.6 MB in the beginning and 93.9 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:44:04,777 INFO L168 Benchmark]: RCFGBuilder took 1013.64 ms. Allocated memory is still 123.7 MB. Free memory was 93.9 MB in the beginning and 96.5 MB in the end (delta: -2.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 16.1 GB. [2020-11-29 18:44:04,778 INFO L168 Benchmark]: BuchiAutomizer took 9373.48 ms. Allocated memory was 123.7 MB in the beginning and 218.1 MB in the end (delta: 94.4 MB). Free memory was 96.5 MB in the beginning and 134.7 MB in the end (delta: -38.2 MB). Peak memory consumption was 58.3 MB. Max. memory is 16.1 GB. [2020-11-29 18:44:04,779 INFO L168 Benchmark]: Witness Printer took 7.04 ms. Allocated memory is still 218.1 MB. Free memory was 134.7 MB in the beginning and 133.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:44:04,790 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 86.0 MB. Free memory is still 44.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 497.11 ms. Allocated memory is still 123.7 MB. Free memory was 96.5 MB in the beginning and 98.0 MB in the end (delta: -1.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.77 ms. Allocated memory is still 123.7 MB. Free memory was 97.7 MB in the beginning and 95.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 100.18 ms. Allocated memory is still 123.7 MB. Free memory was 95.6 MB in the beginning and 93.9 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 1013.64 ms. Allocated memory is still 123.7 MB. Free memory was 93.9 MB in the beginning and 96.5 MB in the end (delta: -2.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 9373.48 ms. Allocated memory was 123.7 MB in the beginning and 218.1 MB in the end (delta: 94.4 MB). Free memory was 96.5 MB in the beginning and 134.7 MB in the end (delta: -38.2 MB). Peak memory consumption was 58.3 MB. Max. memory is 16.1 GB. * Witness Printer took 7.04 ms. Allocated memory is still 218.1 MB. Free memory was 134.7 MB in the beginning and 133.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 42 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 107 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 443 SDtfs, 215 SDslu, 752 SDs, 0 SdLazy, 46 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax100 hnf98 lsp68 ukn75 mio100 lsp100 div141 bol100 ite100 ukn100 eq184 hnf74 smp100 dnf691 smp48 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 210ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...