./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy1.cil.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_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/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 f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:21:44,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:21:44,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:21:44,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:21:44,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:21:44,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:21:44,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:21:44,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:21:44,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:21:44,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:21:44,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:21:44,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:21:44,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:21:44,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:21:44,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:21:44,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:21:44,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:21:44,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:21:44,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:21:44,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:21:44,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:21:44,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:21:44,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:21:44,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:21:44,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:21:44,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:21:44,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:21:44,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:21:44,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:21:44,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:21:44,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:21:44,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:21:44,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:21:44,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:21:44,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:21:44,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:21:44,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:21:44,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:21:44,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:21:44,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:21:44,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:21:44,882 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 00:21:44,921 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:21:44,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:21:44,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:21:44,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:21:44,923 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:21:44,923 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:21:44,924 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:21:44,924 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:21:44,924 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:21:44,924 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:21:44,925 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:21:44,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:21:44,926 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:21:44,926 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:21:44,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:21:44,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:21:44,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:21:44,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:21:44,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:21:44,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:21:44,928 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:21:44,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:21:44,928 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:21:44,928 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:21:44,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:21:44,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:21:44,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:21:44,929 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:21:44,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:21:44,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:21:44,931 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:21:44,931 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:21:44,933 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:21:44,933 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_012e5ed0-a223-47aa-8892-7d50e8b2f918/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_012e5ed0-a223-47aa-8892-7d50e8b2f918/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 -> f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 [2020-11-30 00:21:45,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:21:45,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:21:45,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:21:45,263 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:21:45,266 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:21:45,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/../../sv-benchmarks/c/systemc/toy1.cil.c [2020-11-30 00:21:45,334 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/data/ee1982a5c/652416ce879e4b45814b5202f7c05e98/FLAG1410ac442 [2020-11-30 00:21:45,871 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:21:45,874 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/sv-benchmarks/c/systemc/toy1.cil.c [2020-11-30 00:21:45,889 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/data/ee1982a5c/652416ce879e4b45814b5202f7c05e98/FLAG1410ac442 [2020-11-30 00:21:46,187 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/data/ee1982a5c/652416ce879e4b45814b5202f7c05e98 [2020-11-30 00:21:46,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:21:46,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:21:46,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:21:46,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:21:46,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:21:46,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e381d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46, skipping insertion in model container [2020-11-30 00:21:46,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:21:46,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:21:46,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:21:46,605 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:21:46,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:21:46,664 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:21:46,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46 WrapperNode [2020-11-30 00:21:46,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:21:46,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:21:46,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:21:46,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:21:46,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:21:46,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:21:46,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:21:46,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:21:46,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... [2020-11-30 00:21:46,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:21:46,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:21:46,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:21:46,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:21:46,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/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-30 00:21:46,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:21:46,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:21:46,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:21:46,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:21:47,773 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:21:47,773 INFO L298 CfgBuilder]: Removed 32 assume(true) statements. [2020-11-30 00:21:47,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:21:47 BoogieIcfgContainer [2020-11-30 00:21:47,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:21:47,776 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:21:47,776 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:21:47,782 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:21:47,783 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:21:47,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:21:46" (1/3) ... [2020-11-30 00:21:47,784 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6670c668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:21:47, skipping insertion in model container [2020-11-30 00:21:47,784 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:21:47,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:21:46" (2/3) ... [2020-11-30 00:21:47,785 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6670c668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:21:47, skipping insertion in model container [2020-11-30 00:21:47,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:21:47,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:21:47" (3/3) ... [2020-11-30 00:21:47,787 INFO L373 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2020-11-30 00:21:47,830 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:21:47,830 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:21:47,830 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:21:47,830 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:21:47,831 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:21:47,831 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:21:47,831 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:21:47,831 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:21:47,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2020-11-30 00:21:47,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2020-11-30 00:21:47,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:47,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:47,881 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] [2020-11-30 00:21:47,881 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] [2020-11-30 00:21:47,881 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:21:47,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2020-11-30 00:21:47,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2020-11-30 00:21:47,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:47,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:47,920 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] [2020-11-30 00:21:47,920 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] [2020-11-30 00:21:47,927 INFO L794 eck$LassoCheckResult]: Stem: 103#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 13#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 58#L408true assume !(1 == ~c_req_up~0); 62#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 60#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 84#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 112#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 131#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 30#L439-1true assume !(0 == ~e_f~0); 54#L444-1true assume !(0 == ~e_g~0); 81#L449-1true assume !(0 == ~e_e~0); 108#L454-1true assume !(0 == ~e_c~0); 129#L459-1true assume !(0 == ~e_wl~0); 24#L464-1true assume !(1 == ~wl_pc~0); 107#L476true assume !(2 == ~wl_pc~0); 53#L477true assume !(1 == ~c1_pc~0); 105#L487true assume !(1 == ~c2_pc~0); 74#L496true assume !(1 == ~wb_pc~0); 26#L505true assume !(1 == ~e_c~0); 126#L514-1true assume !(1 == ~e_e~0); 21#L519-1true assume !(1 == ~e_f~0); 48#L524-1true assume !(1 == ~e_g~0); 75#L529-1true assume !(1 == ~e_c~0); 98#L534-1true assume !(1 == ~e_wl~0); 6#L676-1true [2020-11-30 00:21:47,941 INFO L796 eck$LassoCheckResult]: Loop: 6#L676-1true assume !false; 45#L546true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 35#L381true assume !true; 59#L397true start_simulation_~kernel_st~0 := 2; 18#L552true assume !(1 == ~c_req_up~0); 22#L552-2true start_simulation_~kernel_st~0 := 3; 100#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 104#L564-2true assume 0 == ~e_g~0;~e_g~0 := 1; 124#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 19#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 46#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 72#L584-1true assume 1 == ~wl_pc~0; 42#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 117#L597true assume !(1 == ~c1_pc~0); 32#L607true assume !(1 == ~c2_pc~0); 119#L616true assume !(1 == ~wb_pc~0); 87#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 41#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 68#L639-1true assume 1 == ~e_f~0;~e_f~0 := 2; 94#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 120#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 8#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 38#L659-1true assume 0 == ~wl_st~0; 6#L676-1true [2020-11-30 00:21:47,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:47,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2020-11-30 00:21:47,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:47,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870678141] [2020-11-30 00:21:47,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:48,201 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-30 00:21:48,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870678141] [2020-11-30 00:21:48,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:48,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:48,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334291900] [2020-11-30 00:21:48,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:21:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash -215395975, now seen corresponding path program 1 times [2020-11-30 00:21:48,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:48,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913698366] [2020-11-30 00:21:48,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:48,222 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-30 00:21:48,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913698366] [2020-11-30 00:21:48,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:48,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:21:48,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183441695] [2020-11-30 00:21:48,225 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:21:48,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:48,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 00:21:48,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 00:21:48,243 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2020-11-30 00:21:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:48,258 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2020-11-30 00:21:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 00:21:48,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 221 transitions. [2020-11-30 00:21:48,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-11-30 00:21:48,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 121 states and 215 transitions. [2020-11-30 00:21:48,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2020-11-30 00:21:48,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2020-11-30 00:21:48,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 215 transitions. [2020-11-30 00:21:48,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:21:48,276 INFO L691 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2020-11-30 00:21:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 215 transitions. [2020-11-30 00:21:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-11-30 00:21:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-30 00:21:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2020-11-30 00:21:48,312 INFO L714 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2020-11-30 00:21:48,312 INFO L594 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2020-11-30 00:21:48,313 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:21:48,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 215 transitions. [2020-11-30 00:21:48,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-11-30 00:21:48,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:48,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:48,318 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] [2020-11-30 00:21:48,318 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, 1, 1, 1] [2020-11-30 00:21:48,318 INFO L794 eck$LassoCheckResult]: Stem: 379#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 285#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 286#L408 assume !(1 == ~c_req_up~0); 277#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 351#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 352#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 372#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 383#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 315#L439-1 assume !(0 == ~e_f~0); 316#L444-1 assume !(0 == ~e_g~0); 349#L449-1 assume !(0 == ~e_e~0); 369#L454-1 assume !(0 == ~e_c~0); 382#L459-1 assume !(0 == ~e_wl~0); 307#L464-1 assume !(1 == ~wl_pc~0); 308#L476 assume !(2 == ~wl_pc~0); 348#L477 assume !(1 == ~c1_pc~0); 345#L487 assume !(1 == ~c2_pc~0); 302#L496 assume !(1 == ~wb_pc~0); 310#L505 assume !(1 == ~e_c~0); 311#L514-1 assume !(1 == ~e_e~0); 303#L519-1 assume !(1 == ~e_f~0); 304#L524-1 assume !(1 == ~e_g~0); 341#L529-1 assume !(1 == ~e_c~0); 363#L534-1 assume !(1 == ~e_wl~0); 266#L676-1 [2020-11-30 00:21:48,319 INFO L796 eck$LassoCheckResult]: Loop: 266#L676-1 assume !false; 272#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 326#L381 assume !false; 293#L299 assume !(0 == ~wl_st~0); 295#L303 assume !(0 == ~c1_st~0); 361#L306 assume !(0 == ~c2_st~0); 355#L309 assume !(0 == ~wb_st~0); 337#L312 assume !(0 == ~r_st~0); 338#L397 start_simulation_~kernel_st~0 := 2; 296#L552 assume !(1 == ~c_req_up~0); 298#L552-2 start_simulation_~kernel_st~0 := 3; 305#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 377#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 380#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 299#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 300#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 339#L584-1 assume !(1 == ~wl_pc~0); 288#L596 assume !(2 == ~wl_pc~0); 289#L597 assume !(1 == ~c1_pc~0); 320#L607 assume !(1 == ~c2_pc~0); 322#L616 assume !(1 == ~wb_pc~0); 330#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 331#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 332#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 356#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 375#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 275#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 276#L659-1 assume 0 == ~wl_st~0; 266#L676-1 [2020-11-30 00:21:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:48,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2020-11-30 00:21:48,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:48,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639189329] [2020-11-30 00:21:48,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:48,388 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-30 00:21:48,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639189329] [2020-11-30 00:21:48,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:48,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:48,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717521810] [2020-11-30 00:21:48,389 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:21:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash -744717060, now seen corresponding path program 1 times [2020-11-30 00:21:48,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:48,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171629608] [2020-11-30 00:21:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:48,463 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-30 00:21:48,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171629608] [2020-11-30 00:21:48,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:48,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:21:48,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463920556] [2020-11-30 00:21:48,465 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:21:48,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:21:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:21:48,466 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. cyclomatic complexity: 95 Second operand 3 states. [2020-11-30 00:21:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:48,505 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2020-11-30 00:21:48,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:21:48,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 214 transitions. [2020-11-30 00:21:48,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-11-30 00:21:48,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 214 transitions. [2020-11-30 00:21:48,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2020-11-30 00:21:48,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2020-11-30 00:21:48,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 214 transitions. [2020-11-30 00:21:48,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:21:48,522 INFO L691 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2020-11-30 00:21:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 214 transitions. [2020-11-30 00:21:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-11-30 00:21:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-30 00:21:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2020-11-30 00:21:48,531 INFO L714 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2020-11-30 00:21:48,531 INFO L594 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2020-11-30 00:21:48,531 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:21:48,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 214 transitions. [2020-11-30 00:21:48,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-11-30 00:21:48,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:48,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:48,540 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] [2020-11-30 00:21:48,541 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, 1, 1, 1] [2020-11-30 00:21:48,542 INFO L794 eck$LassoCheckResult]: Stem: 628#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 534#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 535#L408 assume !(1 == ~c_req_up~0); 526#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 600#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 601#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 621#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 632#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 564#L439-1 assume !(0 == ~e_f~0); 565#L444-1 assume !(0 == ~e_g~0); 598#L449-1 assume !(0 == ~e_e~0); 618#L454-1 assume !(0 == ~e_c~0); 631#L459-1 assume !(0 == ~e_wl~0); 556#L464-1 assume !(1 == ~wl_pc~0); 557#L476 assume !(2 == ~wl_pc~0); 597#L477 assume !(1 == ~c1_pc~0); 594#L487 assume !(1 == ~c2_pc~0); 551#L496 assume !(1 == ~wb_pc~0); 559#L505 assume !(1 == ~e_c~0); 560#L514-1 assume !(1 == ~e_e~0); 552#L519-1 assume !(1 == ~e_f~0); 553#L524-1 assume !(1 == ~e_g~0); 590#L529-1 assume !(1 == ~e_c~0); 612#L534-1 assume !(1 == ~e_wl~0); 515#L676-1 [2020-11-30 00:21:48,542 INFO L796 eck$LassoCheckResult]: Loop: 515#L676-1 assume !false; 521#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 575#L381 assume !false; 542#L299 assume !(0 == ~wl_st~0); 544#L303 assume !(0 == ~c1_st~0); 610#L306 assume !(0 == ~c2_st~0); 604#L309 assume !(0 == ~wb_st~0); 586#L312 assume !(0 == ~r_st~0); 587#L397 start_simulation_~kernel_st~0 := 2; 545#L552 assume !(1 == ~c_req_up~0); 547#L552-2 start_simulation_~kernel_st~0 := 3; 554#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 626#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 629#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 548#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 549#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 588#L584-1 assume 1 == ~wl_pc~0; 582#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 538#L597 assume !(1 == ~c1_pc~0); 569#L607 assume !(1 == ~c2_pc~0); 571#L616 assume !(1 == ~wb_pc~0); 578#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 580#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 581#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 605#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 624#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 524#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 525#L659-1 assume 0 == ~wl_st~0; 515#L676-1 [2020-11-30 00:21:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:48,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2020-11-30 00:21:48,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:48,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21579033] [2020-11-30 00:21:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:48,624 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-30 00:21:48,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21579033] [2020-11-30 00:21:48,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:48,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:48,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224262578] [2020-11-30 00:21:48,625 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:21:48,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1293976781, now seen corresponding path program 1 times [2020-11-30 00:21:48,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:48,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599410726] [2020-11-30 00:21:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:48,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:48,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:48,688 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:48,854 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-30 00:21:48,977 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-11-30 00:21:48,987 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:21:48,990 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:21:48,990 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:21:48,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:21:48,991 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:21:48,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:48,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:21:48,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:21:48,991 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration3_Loop [2020-11-30 00:21:48,991 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:21:48,992 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:21:49,011 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-30 00:21:49,020 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-30 00:21:49,023 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-30 00:21:49,034 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-30 00:21:49,038 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-30 00:21:49,042 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-30 00:21:49,051 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-30 00:21:49,060 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-30 00:21:49,065 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-30 00:21:49,070 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-30 00:21:49,074 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-30 00:21:49,078 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-30 00:21:49,085 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-30 00:21:49,089 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-30 00:21:49,093 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-30 00:21:49,101 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-30 00:21:49,105 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-30 00:21:49,113 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-30 00:21:49,117 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-30 00:21:49,121 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-30 00:21:49,124 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-30 00:21:49,132 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-30 00:21:49,136 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-30 00:21:49,140 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-30 00:21:49,144 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-30 00:21:49,148 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-30 00:21:49,518 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:21:49,519 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/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-30 00:21:49,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:49,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:49,566 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:49,566 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/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) [2020-11-30 00:21:49,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:49,590 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:49,594 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:49,595 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:49,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:49,618 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:49,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:21:49,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:49,649 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:21:49,685 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:21:49,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:21:49,685 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:21:49,685 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:21:49,685 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:21:49,685 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:49,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:21:49,686 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:21:49,686 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration3_Loop [2020-11-30 00:21:49,686 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:21:49,686 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:21:49,689 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-30 00:21:49,721 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-30 00:21:49,741 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-30 00:21:49,787 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-30 00:21:49,791 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-30 00:21:49,795 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-30 00:21:49,800 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-30 00:21:49,807 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-30 00:21:49,812 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-30 00:21:49,817 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-30 00:21:49,820 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-30 00:21:49,825 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-30 00:21:49,834 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-30 00:21:49,839 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-30 00:21:49,843 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-30 00:21:49,851 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-30 00:21:49,855 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-30 00:21:49,864 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-30 00:21:49,867 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-30 00:21:49,872 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-30 00:21:49,876 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-30 00:21:49,890 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-30 00:21:49,894 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-30 00:21:49,900 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-30 00:21:49,905 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-30 00:21:49,908 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-30 00:21:50,272 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:21:50,279 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:50,288 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-30 00:21:50,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:50,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:50,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:50,291 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-11-30 00:21:50,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:50,294 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-11-30 00:21:50,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:50,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:50,335 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-30 00:21:50,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:50,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:50,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:50,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:50,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:50,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:50,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:50,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:50,381 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-30 00:21:50,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:50,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:50,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:50,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:50,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:50,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:50,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:50,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:21:50,399 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 00:21:50,399 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_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:50,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:21:50,408 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:21:50,408 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:21:50,409 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:50,444 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:21:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:50,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:21:50,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:21:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:50,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:21:50,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:21:50,797 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-30 00:21:50,800 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-11-30 00:21:50,801 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 214 transitions. cyclomatic complexity: 94 Second operand 5 states. [2020-11-30 00:21:51,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 214 transitions. cyclomatic complexity: 94. Second operand 5 states. Result 397 states and 694 transitions. Complement of second has 5 states. [2020-11-30 00:21:51,011 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-30 00:21:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-11-30 00:21:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2020-11-30 00:21:51,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2020-11-30 00:21:51,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:21:51,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2020-11-30 00:21:51,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:21:51,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2020-11-30 00:21:51,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:21:51,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397 states and 694 transitions. [2020-11-30 00:21:51,032 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 270 [2020-11-30 00:21:51,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397 states to 397 states and 694 transitions. [2020-11-30 00:21:51,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2020-11-30 00:21:51,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 305 [2020-11-30 00:21:51,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 397 states and 694 transitions. [2020-11-30 00:21:51,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:51,045 INFO L691 BuchiCegarLoop]: Abstraction has 397 states and 694 transitions. [2020-11-30 00:21:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states and 694 transitions. [2020-11-30 00:21:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 304. [2020-11-30 00:21:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-30 00:21:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 533 transitions. [2020-11-30 00:21:51,073 INFO L714 BuchiCegarLoop]: Abstraction has 304 states and 533 transitions. [2020-11-30 00:21:51,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:21:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:21:51,074 INFO L87 Difference]: Start difference. First operand 304 states and 533 transitions. Second operand 3 states. [2020-11-30 00:21:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:51,092 INFO L93 Difference]: Finished difference Result 304 states and 532 transitions. [2020-11-30 00:21:51,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:21:51,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 304 states and 532 transitions. [2020-11-30 00:21:51,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 180 [2020-11-30 00:21:51,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 304 states to 304 states and 532 transitions. [2020-11-30 00:21:51,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2020-11-30 00:21:51,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2020-11-30 00:21:51,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 304 states and 532 transitions. [2020-11-30 00:21:51,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:51,101 INFO L691 BuchiCegarLoop]: Abstraction has 304 states and 532 transitions. [2020-11-30 00:21:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states and 532 transitions. [2020-11-30 00:21:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-11-30 00:21:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-30 00:21:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 532 transitions. [2020-11-30 00:21:51,115 INFO L714 BuchiCegarLoop]: Abstraction has 304 states and 532 transitions. [2020-11-30 00:21:51,115 INFO L594 BuchiCegarLoop]: Abstraction has 304 states and 532 transitions. [2020-11-30 00:21:51,116 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:21:51,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 532 transitions. [2020-11-30 00:21:51,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 180 [2020-11-30 00:21:51,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:51,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:51,120 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] [2020-11-30 00:21:51,120 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, 1, 1, 1] [2020-11-30 00:21:51,120 INFO L794 eck$LassoCheckResult]: Stem: 2026#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1862#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1863#L408 assume !(1 == ~c_req_up~0); 1839#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1971#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1972#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2008#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 2031#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1904#L439-1 assume !(0 == ~e_f~0); 1905#L444-1 assume !(0 == ~e_g~0); 1968#L449-1 assume !(0 == ~e_e~0); 2003#L454-1 assume !(0 == ~e_c~0); 2030#L459-1 assume !(0 == ~e_wl~0); 1893#L464-1 assume !(1 == ~wl_pc~0); 1894#L476 assume !(2 == ~wl_pc~0); 1967#L477 assume !(1 == ~c1_pc~0); 1966#L487 assume !(1 == ~c2_pc~0); 1886#L496 assume !(1 == ~wb_pc~0); 1896#L505 assume !(1 == ~e_c~0); 1897#L514-1 assume !(1 == ~e_e~0); 1887#L519-1 assume !(1 == ~e_f~0); 1888#L524-1 assume !(1 == ~e_g~0); 1956#L529-1 assume !(1 == ~e_c~0); 1992#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1818#L676-1 [2020-11-30 00:21:51,120 INFO L796 eck$LassoCheckResult]: Loop: 1818#L676-1 assume !false; 1829#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1924#L381 assume !false; 1868#L299 assume !(0 == ~wl_st~0); 1870#L303 assume !(0 == ~c1_st~0); 1989#L306 assume !(0 == ~c2_st~0); 1977#L309 assume !(0 == ~wb_st~0); 1946#L312 assume !(0 == ~r_st~0); 1947#L397 start_simulation_~kernel_st~0 := 2; 1874#L552 assume !(1 == ~c_req_up~0); 1876#L552-2 start_simulation_~kernel_st~0 := 3; 1889#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 2022#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2027#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2054#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1950#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1951#L584-1 assume !(1 == ~wl_pc~0); 1856#L596 assume !(2 == ~wl_pc~0); 1857#L597 assume !(1 == ~c1_pc~0); 1912#L607 assume !(1 == ~c2_pc~0); 1914#L616 assume !(1 == ~wb_pc~0); 1929#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1934#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1935#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1979#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2040#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1835#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1836#L659-1 assume 0 == ~wl_st~0; 1818#L676-1 [2020-11-30 00:21:51,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539629, now seen corresponding path program 1 times [2020-11-30 00:21:51,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:51,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043969418] [2020-11-30 00:21:51,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:51,163 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-30 00:21:51,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043969418] [2020-11-30 00:21:51,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:51,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:51,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882389268] [2020-11-30 00:21:51,164 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:21:51,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:51,165 INFO L82 PathProgramCache]: Analyzing trace with hash -744717060, now seen corresponding path program 2 times [2020-11-30 00:21:51,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:51,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286867295] [2020-11-30 00:21:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:51,190 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-30 00:21:51,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286867295] [2020-11-30 00:21:51,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:51,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:21:51,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793685282] [2020-11-30 00:21:51,191 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:21:51,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:21:51,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:21:51,192 INFO L87 Difference]: Start difference. First operand 304 states and 532 transitions. cyclomatic complexity: 231 Second operand 3 states. [2020-11-30 00:21:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:51,207 INFO L93 Difference]: Finished difference Result 304 states and 531 transitions. [2020-11-30 00:21:51,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:21:51,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 304 states and 531 transitions. [2020-11-30 00:21:51,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 180 [2020-11-30 00:21:51,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 304 states to 304 states and 531 transitions. [2020-11-30 00:21:51,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2020-11-30 00:21:51,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2020-11-30 00:21:51,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 304 states and 531 transitions. [2020-11-30 00:21:51,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:51,215 INFO L691 BuchiCegarLoop]: Abstraction has 304 states and 531 transitions. [2020-11-30 00:21:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states and 531 transitions. [2020-11-30 00:21:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-11-30 00:21:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-30 00:21:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 531 transitions. [2020-11-30 00:21:51,226 INFO L714 BuchiCegarLoop]: Abstraction has 304 states and 531 transitions. [2020-11-30 00:21:51,226 INFO L594 BuchiCegarLoop]: Abstraction has 304 states and 531 transitions. [2020-11-30 00:21:51,226 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:21:51,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 531 transitions. [2020-11-30 00:21:51,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 180 [2020-11-30 00:21:51,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:51,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:51,230 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] [2020-11-30 00:21:51,230 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, 1, 1, 1] [2020-11-30 00:21:51,230 INFO L794 eck$LassoCheckResult]: Stem: 2644#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 2469#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 2470#L408 assume !(1 == ~c_req_up~0); 2454#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2589#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2590#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2626#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 2650#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2520#L439-1 assume !(0 == ~e_f~0); 2521#L444-1 assume !(0 == ~e_g~0); 2585#L449-1 assume !(0 == ~e_e~0); 2621#L454-1 assume !(0 == ~e_c~0); 2649#L459-1 assume !(0 == ~e_wl~0); 2509#L464-1 assume !(1 == ~wl_pc~0); 2510#L476 assume !(2 == ~wl_pc~0); 2584#L477 assume !(1 == ~c1_pc~0); 2579#L487 assume !(1 == ~c2_pc~0); 2501#L496 assume !(1 == ~wb_pc~0); 2512#L505 assume !(1 == ~e_c~0); 2513#L514-1 assume !(1 == ~e_e~0); 2502#L519-1 assume !(1 == ~e_f~0); 2503#L524-1 assume !(1 == ~e_g~0); 2573#L529-1 assume !(1 == ~e_c~0); 2610#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2433#L676-1 [2020-11-30 00:21:51,230 INFO L796 eck$LassoCheckResult]: Loop: 2433#L676-1 assume !false; 2444#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 2540#L381 assume !false; 2483#L299 assume !(0 == ~wl_st~0); 2485#L303 assume !(0 == ~c1_st~0); 2607#L306 assume !(0 == ~c2_st~0); 2595#L309 assume !(0 == ~wb_st~0); 2563#L312 assume !(0 == ~r_st~0); 2564#L397 start_simulation_~kernel_st~0 := 2; 2588#L552 assume !(1 == ~c_req_up~0); 2504#L552-2 start_simulation_~kernel_st~0 := 3; 2505#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 2645#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2646#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2656#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 2658#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2729#L584-1 assume 1 == ~wl_pc~0; 2726#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2725#L597 assume !(1 == ~c1_pc~0); 2723#L607 assume !(1 == ~c2_pc~0); 2721#L616 assume !(1 == ~wb_pc~0); 2719#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 2718#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2717#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2716#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2715#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2714#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2548#L659-1 assume 0 == ~wl_st~0; 2433#L676-1 [2020-11-30 00:21:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:51,231 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2020-11-30 00:21:51,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:51,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072704155] [2020-11-30 00:21:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:51,268 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-30 00:21:51,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072704155] [2020-11-30 00:21:51,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:51,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:51,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553550030] [2020-11-30 00:21:51,269 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:21:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1293976781, now seen corresponding path program 2 times [2020-11-30 00:21:51,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:51,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577706945] [2020-11-30 00:21:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:51,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:51,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:51,292 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:51,419 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-30 00:21:51,503 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:21:51,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:21:51,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:21:51,503 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:21:51,503 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:21:51,504 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:51,504 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:21:51,504 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:21:51,504 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration5_Loop [2020-11-30 00:21:51,504 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:21:51,504 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:21:51,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-30 00:21:51,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-30 00:21:51,514 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-30 00:21:51,516 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-30 00:21:51,523 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-30 00:21:51,525 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-30 00:21:51,527 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-30 00:21:51,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-30 00:21:51,533 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-30 00:21:51,537 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-30 00:21:51,540 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-30 00:21:51,545 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-30 00:21:51,554 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-30 00:21:51,557 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-30 00:21:51,562 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-30 00:21:51,565 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-30 00:21:51,570 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-30 00:21:51,572 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-30 00:21:51,577 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-30 00:21:51,580 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-30 00:21:51,601 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-30 00:21:51,604 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-30 00:21:51,607 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-30 00:21:51,610 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-30 00:21:51,630 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-30 00:21:51,634 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-30 00:21:51,984 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:21:51,988 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:52,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:52,002 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,006 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:52,006 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:52,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:52,053 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,058 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:52,058 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:52,099 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:52,100 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,105 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:52,105 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:52,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:52,146 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,149 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:52,149 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:52,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:52,192 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,196 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:52,196 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet9=0} Honda state: {ULTIMATE.start_eval_#t~nondet9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:52,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:52,243 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:52,243 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:52,266 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:52,276 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:52,276 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:52,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:52,323 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,337 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:52,337 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:52,362 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:21:52,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:52,390 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:21:52,410 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:21:52,410 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:21:52,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:21:52,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:21:52,410 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:21:52,410 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:52,410 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:21:52,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:21:52,411 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration5_Loop [2020-11-30 00:21:52,411 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:21:52,411 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:21:52,415 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-30 00:21:52,424 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-30 00:21:52,427 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-30 00:21:52,431 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-30 00:21:52,433 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-30 00:21:52,435 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-30 00:21:52,438 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-30 00:21:52,441 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-30 00:21:52,447 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-30 00:21:52,458 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-30 00:21:52,461 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-30 00:21:52,467 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-30 00:21:52,476 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-30 00:21:52,498 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-30 00:21:52,502 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-30 00:21:52,510 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-30 00:21:52,518 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-30 00:21:52,522 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-30 00:21:52,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-30 00:21:52,537 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-30 00:21:52,544 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-30 00:21:52,548 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-30 00:21:52,556 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-30 00:21:52,559 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-30 00:21:52,563 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-30 00:21:52,570 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-30 00:21:52,969 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:21:52,970 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:52,994 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-30 00:21:52,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:52,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:52,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:52,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:52,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:52,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:52,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:53,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:53,035 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-30 00:21:53,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:53,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:53,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:53,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:53,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:53,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:53,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:21:53,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:53,067 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-30 00:21:53,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:53,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:53,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:53,070 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-11-30 00:21:53,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:53,071 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-11-30 00:21:53,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:21:53,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:53,099 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-30 00:21:53,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:53,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:53,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:53,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:53,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:53,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:53,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:21:53,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:53,127 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 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:53,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:53,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:53,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:53,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:53,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:53,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:53,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:21:53,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:53,197 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-30 00:21:53,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:53,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:53,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:53,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:53,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:53,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:53,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:53,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:53,233 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-30 00:21:53,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:53,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:53,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:53,234 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-11-30 00:21:53,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:53,235 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-11-30 00:21:53,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:21:53,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:53,278 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-30 00:21:53,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:53,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:53,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:53,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:53,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:53,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:53,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:53,288 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:21:53,315 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 00:21:53,315 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_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:21:53,318 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:21:53,318 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:21:53,318 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:21:53,318 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:53,341 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:21:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:53,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:21:53,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:21:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:53,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:21:53,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:21:53,484 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-30 00:21:53,485 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-11-30 00:21:53,485 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 304 states and 531 transitions. cyclomatic complexity: 230 Second operand 5 states. [2020-11-30 00:21:53,556 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 304 states and 531 transitions. cyclomatic complexity: 230. Second operand 5 states. Result 580 states and 1011 transitions. Complement of second has 5 states. [2020-11-30 00:21:53,556 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-30 00:21:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-11-30 00:21:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2020-11-30 00:21:53,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 28 letters. [2020-11-30 00:21:53,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:21:53,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 52 letters. Loop has 28 letters. [2020-11-30 00:21:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:21:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 56 letters. [2020-11-30 00:21:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:21:53,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 1011 transitions. [2020-11-30 00:21:53,569 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2020-11-30 00:21:53,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 580 states and 1011 transitions. [2020-11-30 00:21:53,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2020-11-30 00:21:53,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2020-11-30 00:21:53,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 580 states and 1011 transitions. [2020-11-30 00:21:53,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:53,580 INFO L691 BuchiCegarLoop]: Abstraction has 580 states and 1011 transitions. [2020-11-30 00:21:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states and 1011 transitions. [2020-11-30 00:21:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 304. [2020-11-30 00:21:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-30 00:21:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 531 transitions. [2020-11-30 00:21:53,591 INFO L714 BuchiCegarLoop]: Abstraction has 304 states and 531 transitions. [2020-11-30 00:21:53,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:53,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:21:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:21:53,592 INFO L87 Difference]: Start difference. First operand 304 states and 531 transitions. Second operand 4 states. [2020-11-30 00:21:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:53,736 INFO L93 Difference]: Finished difference Result 577 states and 997 transitions. [2020-11-30 00:21:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:21:53,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 577 states and 997 transitions. [2020-11-30 00:21:53,742 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 301 [2020-11-30 00:21:53,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 577 states to 577 states and 997 transitions. [2020-11-30 00:21:53,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2020-11-30 00:21:53,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 378 [2020-11-30 00:21:53,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 577 states and 997 transitions. [2020-11-30 00:21:53,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:53,749 INFO L691 BuchiCegarLoop]: Abstraction has 577 states and 997 transitions. [2020-11-30 00:21:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states and 997 transitions. [2020-11-30 00:21:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2020-11-30 00:21:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-11-30 00:21:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 995 transitions. [2020-11-30 00:21:53,764 INFO L714 BuchiCegarLoop]: Abstraction has 575 states and 995 transitions. [2020-11-30 00:21:53,764 INFO L594 BuchiCegarLoop]: Abstraction has 575 states and 995 transitions. [2020-11-30 00:21:53,764 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:21:53,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 575 states and 995 transitions. [2020-11-30 00:21:53,769 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 301 [2020-11-30 00:21:53,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:53,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:53,774 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] [2020-11-30 00:21:53,774 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, 1, 1, 1] [2020-11-30 00:21:53,774 INFO L794 eck$LassoCheckResult]: Stem: 4613#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4425#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4426#L408 assume !(1 == ~c_req_up~0); 4542#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4671#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4591#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4592#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4670#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4468#L439-1 assume !(0 == ~e_f~0); 4469#L444-1 assume !(0 == ~e_g~0); 4585#L449-1 assume !(0 == ~e_e~0); 4586#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4624#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4640#L464-1 assume !(1 == ~wl_pc~0); 4656#L476 assume !(2 == ~wl_pc~0); 4654#L477 assume !(1 == ~c1_pc~0); 4652#L487 assume !(1 == ~c2_pc~0); 4650#L496 assume !(1 == ~wb_pc~0); 4648#L505 assume !(1 == ~e_c~0); 4647#L514-1 assume !(1 == ~e_e~0); 4646#L519-1 assume !(1 == ~e_f~0); 4645#L524-1 assume !(1 == ~e_g~0); 4644#L529-1 assume !(1 == ~e_c~0); 4642#L534-1 assume !(1 == ~e_wl~0); 4643#L676-1 assume !false; 4711#L546 [2020-11-30 00:21:53,777 INFO L796 eck$LassoCheckResult]: Loop: 4711#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 4897#L381 assume !false; 4896#L299 assume !(0 == ~wl_st~0); 4895#L303 assume !(0 == ~c1_st~0); 4894#L306 assume !(0 == ~c2_st~0); 4893#L309 assume !(0 == ~wb_st~0); 4891#L312 assume !(0 == ~r_st~0); 4890#L397 start_simulation_~kernel_st~0 := 2; 4437#L552 assume !(1 == ~c_req_up~0); 4439#L552-2 start_simulation_~kernel_st~0 := 3; 4450#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4605#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4614#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 4443#L574-1 assume !(0 == ~e_c~0); 4444#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4516#L584-1 assume 1 == ~wl_pc~0; 4872#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4871#L597 assume !(1 == ~c1_pc~0); 4869#L607 assume !(1 == ~c2_pc~0); 4867#L616 assume !(1 == ~wb_pc~0); 4865#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 4864#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4863#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4862#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4861#L649-1 assume !(1 == ~e_c~0); 4859#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4860#L659-1 assume 0 == ~wl_st~0; 4944#L676-1 assume !false; 4711#L546 [2020-11-30 00:21:53,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash 931746300, now seen corresponding path program 1 times [2020-11-30 00:21:53,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:53,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659964990] [2020-11-30 00:21:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:53,820 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-30 00:21:53,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659964990] [2020-11-30 00:21:53,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:53,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:21:53,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397276551] [2020-11-30 00:21:53,821 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:21:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1567745073, now seen corresponding path program 1 times [2020-11-30 00:21:53,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:53,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321819677] [2020-11-30 00:21:53,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:53,855 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-30 00:21:53,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321819677] [2020-11-30 00:21:53,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:53,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:53,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550232464] [2020-11-30 00:21:53,875 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:21:53,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:53,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:21:53,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:21:53,876 INFO L87 Difference]: Start difference. First operand 575 states and 995 transitions. cyclomatic complexity: 425 Second operand 4 states. [2020-11-30 00:21:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:54,049 INFO L93 Difference]: Finished difference Result 985 states and 1685 transitions. [2020-11-30 00:21:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:21:54,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 985 states and 1685 transitions. [2020-11-30 00:21:54,061 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 477 [2020-11-30 00:21:54,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 985 states to 985 states and 1685 transitions. [2020-11-30 00:21:54,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 603 [2020-11-30 00:21:54,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 603 [2020-11-30 00:21:54,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 985 states and 1685 transitions. [2020-11-30 00:21:54,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:54,073 INFO L691 BuchiCegarLoop]: Abstraction has 985 states and 1685 transitions. [2020-11-30 00:21:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states and 1685 transitions. [2020-11-30 00:21:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 961. [2020-11-30 00:21:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2020-11-30 00:21:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1657 transitions. [2020-11-30 00:21:54,098 INFO L714 BuchiCegarLoop]: Abstraction has 961 states and 1657 transitions. [2020-11-30 00:21:54,099 INFO L594 BuchiCegarLoop]: Abstraction has 961 states and 1657 transitions. [2020-11-30 00:21:54,099 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:21:54,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 961 states and 1657 transitions. [2020-11-30 00:21:54,105 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 477 [2020-11-30 00:21:54,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:54,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:54,106 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] [2020-11-30 00:21:54,106 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, 1, 1, 1] [2020-11-30 00:21:54,107 INFO L794 eck$LassoCheckResult]: Stem: 6194#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 5987#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 5988#L408 assume !(1 == ~c_req_up~0); 6112#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6114#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6115#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6207#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6208#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6038#L439-1 assume !(0 == ~e_f~0); 6039#L444-1 assume !(0 == ~e_g~0); 6109#L449-1 assume !(0 == ~e_e~0); 6203#L454-1 assume !(0 == ~e_c~0); 6204#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6274#L464-1 assume !(1 == ~wl_pc~0); 6272#L476 assume !(2 == ~wl_pc~0); 6270#L477 assume !(1 == ~c1_pc~0); 6268#L487 assume !(1 == ~c2_pc~0); 6266#L496 assume !(1 == ~wb_pc~0); 6264#L505 assume !(1 == ~e_c~0); 6263#L514-1 assume !(1 == ~e_e~0); 6261#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6262#L524-1 assume !(1 == ~e_g~0); 6310#L529-1 assume !(1 == ~e_c~0); 6259#L534-1 assume !(1 == ~e_wl~0); 6309#L676-1 assume !false; 6526#L546 [2020-11-30 00:21:54,107 INFO L796 eck$LassoCheckResult]: Loop: 6526#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 6700#L381 assume !false; 6698#L299 assume !(0 == ~wl_st~0); 6696#L303 assume !(0 == ~c1_st~0); 6694#L306 assume !(0 == ~c2_st~0); 6692#L309 assume !(0 == ~wb_st~0); 6688#L312 assume !(0 == ~r_st~0); 6686#L397 start_simulation_~kernel_st~0 := 2; 6681#L552 assume !(1 == ~c_req_up~0); 6678#L552-2 start_simulation_~kernel_st~0 := 3; 6675#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 6674#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6220#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6221#L574-1 assume !(0 == ~e_c~0); 6673#L579-1 assume !(0 == ~e_wl~0); 6672#L584-1 assume !(1 == ~wl_pc~0); 6657#L596 assume !(2 == ~wl_pc~0); 6669#L597 assume !(1 == ~c1_pc~0); 6667#L607 assume !(1 == ~c2_pc~0); 6666#L616 assume !(1 == ~wb_pc~0); 6661#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 6070#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6071#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6125#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6752#L649-1 assume !(1 == ~e_c~0); 6751#L654-1 assume !(1 == ~e_wl~0); 6540#L659-1 assume 0 == ~wl_st~0; 6712#L676-1 assume !false; 6526#L546 [2020-11-30 00:21:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:54,108 INFO L82 PathProgramCache]: Analyzing trace with hash -81217992, now seen corresponding path program 1 times [2020-11-30 00:21:54,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:54,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33160243] [2020-11-30 00:21:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:54,135 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-30 00:21:54,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33160243] [2020-11-30 00:21:54,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:54,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:21:54,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546636619] [2020-11-30 00:21:54,136 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:21:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1563289062, now seen corresponding path program 1 times [2020-11-30 00:21:54,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:54,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814404857] [2020-11-30 00:21:54,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:54,152 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-30 00:21:54,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814404857] [2020-11-30 00:21:54,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:54,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:54,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302165468] [2020-11-30 00:21:54,153 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:21:54,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:54,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:21:54,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:21:54,153 INFO L87 Difference]: Start difference. First operand 961 states and 1657 transitions. cyclomatic complexity: 705 Second operand 4 states. [2020-11-30 00:21:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:54,256 INFO L93 Difference]: Finished difference Result 1513 states and 2536 transitions. [2020-11-30 00:21:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:21:54,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1513 states and 2536 transitions. [2020-11-30 00:21:54,270 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 829 [2020-11-30 00:21:54,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1513 states to 1513 states and 2536 transitions. [2020-11-30 00:21:54,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 927 [2020-11-30 00:21:54,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 927 [2020-11-30 00:21:54,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1513 states and 2536 transitions. [2020-11-30 00:21:54,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:54,286 INFO L691 BuchiCegarLoop]: Abstraction has 1513 states and 2536 transitions. [2020-11-30 00:21:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states and 2536 transitions. [2020-11-30 00:21:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1464. [2020-11-30 00:21:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2020-11-30 00:21:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2473 transitions. [2020-11-30 00:21:54,322 INFO L714 BuchiCegarLoop]: Abstraction has 1464 states and 2473 transitions. [2020-11-30 00:21:54,322 INFO L594 BuchiCegarLoop]: Abstraction has 1464 states and 2473 transitions. [2020-11-30 00:21:54,323 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:21:54,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1464 states and 2473 transitions. [2020-11-30 00:21:54,332 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 826 [2020-11-30 00:21:54,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:54,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:54,333 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] [2020-11-30 00:21:54,333 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, 1, 1, 1] [2020-11-30 00:21:54,335 INFO L794 eck$LassoCheckResult]: Stem: 8687#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 8473#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 8474#L408 assume !(1 == ~c_req_up~0); 8456#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8607#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8608#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8703#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8704#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8722#L439-1 assume !(0 == ~e_f~0); 8598#L444-1 assume !(0 == ~e_g~0); 8599#L449-1 assume !(0 == ~e_e~0); 8697#L454-1 assume !(0 == ~e_c~0); 8698#L459-1 assume !(0 == ~e_wl~0); 8512#L464-1 assume !(1 == ~wl_pc~0); 8513#L476 assume !(2 == ~wl_pc~0); 8597#L477 assume !(1 == ~c1_pc~0); 8596#L487 assume !(1 == ~c2_pc~0); 8724#L496 assume !(1 == ~wb_pc~0); 8515#L505 assume !(1 == ~e_c~0); 8516#L514-1 assume !(1 == ~e_e~0); 8507#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 8508#L524-1 assume !(1 == ~e_g~0); 8643#L529-1 assume !(1 == ~e_c~0); 8644#L534-1 assume !(1 == ~e_wl~0); 9136#L676-1 assume !false; 8449#L546 [2020-11-30 00:21:54,335 INFO L796 eck$LassoCheckResult]: Loop: 8449#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 8543#L381 assume !false; 8485#L299 assume !(0 == ~wl_st~0); 8487#L303 assume !(0 == ~c1_st~0); 8633#L306 assume !(0 == ~c2_st~0); 8618#L309 assume !(0 == ~wb_st~0); 8571#L312 assume !(0 == ~r_st~0); 8572#L397 start_simulation_~kernel_st~0 := 2; 8602#L552 assume !(1 == ~c_req_up~0); 8503#L552-2 start_simulation_~kernel_st~0 := 3; 8504#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 9841#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9840#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 9839#L574-1 assume !(0 == ~e_c~0); 9838#L579-1 assume !(0 == ~e_wl~0); 9837#L584-1 assume !(1 == ~wl_pc~0); 8475#L596 assume !(2 == ~wl_pc~0); 8476#L597 assume !(1 == ~c1_pc~0); 9833#L607 assume !(1 == ~c2_pc~0); 9831#L616 assume !(1 == ~wb_pc~0); 8661#L625 assume !(1 == ~e_c~0); 8557#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 8558#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 8621#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 8670#L649-1 assume !(1 == ~e_c~0); 8452#L654-1 assume !(1 == ~e_wl~0); 8453#L659-1 assume 0 == ~wl_st~0; 8433#L676-1 assume !false; 8449#L546 [2020-11-30 00:21:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash -668024006, now seen corresponding path program 1 times [2020-11-30 00:21:54,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:54,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325529498] [2020-11-30 00:21:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:54,374 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-30 00:21:54,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325529498] [2020-11-30 00:21:54,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:54,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:21:54,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418159733] [2020-11-30 00:21:54,375 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:21:54,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash 753942436, now seen corresponding path program 1 times [2020-11-30 00:21:54,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:54,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970342344] [2020-11-30 00:21:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:54,397 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-30 00:21:54,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970342344] [2020-11-30 00:21:54,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:54,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:54,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991245217] [2020-11-30 00:21:54,398 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:21:54,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:54,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:21:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:21:54,399 INFO L87 Difference]: Start difference. First operand 1464 states and 2473 transitions. cyclomatic complexity: 1021 Second operand 4 states. [2020-11-30 00:21:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:54,528 INFO L93 Difference]: Finished difference Result 1658 states and 2735 transitions. [2020-11-30 00:21:54,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:21:54,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1658 states and 2735 transitions. [2020-11-30 00:21:54,548 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 932 [2020-11-30 00:21:54,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1658 states to 1658 states and 2735 transitions. [2020-11-30 00:21:54,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1013 [2020-11-30 00:21:54,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1013 [2020-11-30 00:21:54,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1658 states and 2735 transitions. [2020-11-30 00:21:54,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:54,564 INFO L691 BuchiCegarLoop]: Abstraction has 1658 states and 2735 transitions. [2020-11-30 00:21:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states and 2735 transitions. [2020-11-30 00:21:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1614. [2020-11-30 00:21:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-11-30 00:21:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2685 transitions. [2020-11-30 00:21:54,604 INFO L714 BuchiCegarLoop]: Abstraction has 1614 states and 2685 transitions. [2020-11-30 00:21:54,604 INFO L594 BuchiCegarLoop]: Abstraction has 1614 states and 2685 transitions. [2020-11-30 00:21:54,604 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 00:21:54,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1614 states and 2685 transitions. [2020-11-30 00:21:54,613 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 927 [2020-11-30 00:21:54,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:54,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:54,615 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] [2020-11-30 00:21:54,615 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, 1, 1, 1] [2020-11-30 00:21:54,615 INFO L794 eck$LassoCheckResult]: Stem: 11814#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 11603#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 11604#L408 assume !(1 == ~c_req_up~0); 11588#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 11731#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 11780#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 11781#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 11862#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 11861#L439-1 assume !(0 == ~e_f~0); 11860#L444-1 assume !(0 == ~e_g~0); 11859#L449-1 assume !(0 == ~e_e~0); 11858#L454-1 assume !(0 == ~e_c~0); 11857#L459-1 assume !(0 == ~e_wl~0); 11856#L464-1 assume !(1 == ~wl_pc~0); 11853#L476 assume !(2 == ~wl_pc~0); 11852#L477 assume !(1 == ~c1_pc~0); 11817#L487 assume !(1 == ~c2_pc~0); 11634#L496 assume !(1 == ~wb_pc~0); 11762#L505 assume !(1 == ~e_c~0); 11844#L514-1 assume !(1 == ~e_e~0); 11845#L519-1 assume !(1 == ~e_f~0); 11710#L524-1 assume !(1 == ~e_g~0); 11711#L529-1 assume !(1 == ~e_c~0); 11764#L534-1 assume !(1 == ~e_wl~0); 11803#L676-1 assume !false; 12066#L546 [2020-11-30 00:21:54,615 INFO L796 eck$LassoCheckResult]: Loop: 12066#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 12850#L381 assume !false; 12804#L299 assume !(0 == ~wl_st~0); 12803#L303 assume !(0 == ~c1_st~0); 12802#L306 assume !(0 == ~c2_st~0); 12799#L309 assume !(0 == ~wb_st~0); 12796#L312 assume !(0 == ~r_st~0); 12798#L397 start_simulation_~kernel_st~0 := 2; 12898#L552 assume !(1 == ~c_req_up~0); 12894#L552-2 start_simulation_~kernel_st~0 := 3; 12891#L564 assume !(0 == ~e_f~0); 12889#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 12887#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 12885#L574-1 assume !(0 == ~e_c~0); 12884#L579-1 assume !(0 == ~e_wl~0); 12883#L584-1 assume !(1 == ~wl_pc~0); 12880#L596 assume !(2 == ~wl_pc~0); 12879#L597 assume !(1 == ~c1_pc~0); 12877#L607 assume !(1 == ~c2_pc~0); 12875#L616 assume !(1 == ~wb_pc~0); 12873#L625 assume !(1 == ~e_c~0); 12872#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 12871#L639-1 assume !(1 == ~e_f~0); 12870#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 12869#L649-1 assume !(1 == ~e_c~0); 12868#L654-1 assume !(1 == ~e_wl~0); 12867#L659-1 assume 0 == ~wl_st~0; 12814#L676-1 assume !false; 12066#L546 [2020-11-30 00:21:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2020-11-30 00:21:54,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:54,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474993383] [2020-11-30 00:21:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:54,633 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:54,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:54,665 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:54,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:54,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1182943968, now seen corresponding path program 1 times [2020-11-30 00:21:54,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:54,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688782408] [2020-11-30 00:21:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:54,703 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-30 00:21:54,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688782408] [2020-11-30 00:21:54,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:54,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:54,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354629948] [2020-11-30 00:21:54,704 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:21:54,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:21:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:21:54,705 INFO L87 Difference]: Start difference. First operand 1614 states and 2685 transitions. cyclomatic complexity: 1083 Second operand 3 states. [2020-11-30 00:21:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:54,807 INFO L93 Difference]: Finished difference Result 2558 states and 4217 transitions. [2020-11-30 00:21:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:21:54,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2558 states and 4217 transitions. [2020-11-30 00:21:54,829 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1483 [2020-11-30 00:21:54,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2558 states to 2558 states and 4217 transitions. [2020-11-30 00:21:54,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1546 [2020-11-30 00:21:54,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1546 [2020-11-30 00:21:54,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2558 states and 4217 transitions. [2020-11-30 00:21:54,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:54,853 INFO L691 BuchiCegarLoop]: Abstraction has 2558 states and 4217 transitions. [2020-11-30 00:21:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states and 4217 transitions. [2020-11-30 00:21:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2020-11-30 00:21:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2020-11-30 00:21:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4217 transitions. [2020-11-30 00:21:54,913 INFO L714 BuchiCegarLoop]: Abstraction has 2558 states and 4217 transitions. [2020-11-30 00:21:54,913 INFO L594 BuchiCegarLoop]: Abstraction has 2558 states and 4217 transitions. [2020-11-30 00:21:54,913 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-30 00:21:54,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2558 states and 4217 transitions. [2020-11-30 00:21:54,927 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1483 [2020-11-30 00:21:54,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:54,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:54,930 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] [2020-11-30 00:21:54,930 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, 1, 1, 1, 1] [2020-11-30 00:21:54,930 INFO L794 eck$LassoCheckResult]: Stem: 16003#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 15785#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 15786#L408 assume !(1 == ~c_req_up~0); 15768#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 15910#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 15967#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 15968#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16050#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16049#L439-1 assume !(0 == ~e_f~0); 16048#L444-1 assume !(0 == ~e_g~0); 16047#L449-1 assume !(0 == ~e_e~0); 16046#L454-1 assume !(0 == ~e_c~0); 16045#L459-1 assume !(0 == ~e_wl~0); 16044#L464-1 assume !(1 == ~wl_pc~0); 16041#L476 assume !(2 == ~wl_pc~0); 16040#L477 assume !(1 == ~c1_pc~0); 16006#L487 assume !(1 == ~c2_pc~0); 15814#L496 assume !(1 == ~wb_pc~0); 15945#L505 assume !(1 == ~e_c~0); 16032#L514-1 assume !(1 == ~e_e~0); 16033#L519-1 assume !(1 == ~e_f~0); 15888#L524-1 assume !(1 == ~e_g~0); 15889#L529-1 assume !(1 == ~e_c~0); 15947#L534-1 assume !(1 == ~e_wl~0); 15993#L676-1 assume !false; 16346#L546 [2020-11-30 00:21:54,930 INFO L796 eck$LassoCheckResult]: Loop: 16346#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 17352#L381 assume !false; 17353#L299 assume !(0 == ~wl_st~0); 17714#L303 assume !(0 == ~c1_st~0); 17713#L306 assume !(0 == ~c2_st~0); 17712#L309 assume !(0 == ~wb_st~0); 17702#L312 assume !(0 == ~r_st~0); 17704#L397 start_simulation_~kernel_st~0 := 2; 17666#L552 assume !(1 == ~c_req_up~0); 17667#L552-2 start_simulation_~kernel_st~0 := 3; 17875#L564 assume !(0 == ~e_f~0); 17874#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 17873#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 17871#L574-1 assume !(0 == ~e_c~0); 17870#L579-1 assume !(0 == ~e_wl~0); 17869#L584-1 assume !(1 == ~wl_pc~0); 17866#L596 assume 2 == ~wl_pc~0; 17867#L598 assume 1 == ~e_e~0;~wl_st~0 := 0; 16022#L597 assume !(1 == ~c1_pc~0); 15842#L607 assume !(1 == ~c2_pc~0); 15844#L616 assume !(1 == ~wb_pc~0); 15859#L625 assume !(1 == ~e_c~0); 15865#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 15866#L639-1 assume !(1 == ~e_f~0); 15926#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 15985#L649-1 assume !(1 == ~e_c~0); 17441#L654-1 assume !(1 == ~e_wl~0); 17415#L659-1 assume 0 == ~wl_st~0; 17414#L676-1 assume !false; 16346#L546 [2020-11-30 00:21:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:54,932 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2020-11-30 00:21:54,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:54,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484120863] [2020-11-30 00:21:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:54,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:54,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:54,977 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:54,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1234385909, now seen corresponding path program 1 times [2020-11-30 00:21:54,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:54,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630555472] [2020-11-30 00:21:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:54,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:54,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:54,994 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:54,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:54,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1871779738, now seen corresponding path program 1 times [2020-11-30 00:21:54,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:54,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44730374] [2020-11-30 00:21:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:21:55,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44730374] [2020-11-30 00:21:55,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:55,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:55,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797041715] [2020-11-30 00:21:55,208 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-11-30 00:21:55,277 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:21:55,278 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:21:55,278 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:21:55,278 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:21:55,278 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:21:55,278 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:55,278 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:21:55,278 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:21:55,278 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2020-11-30 00:21:55,278 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:21:55,278 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:21:55,280 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-30 00:21:55,296 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-30 00:21:55,303 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-30 00:21:55,306 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-30 00:21:55,309 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-30 00:21:55,320 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-30 00:21:55,322 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-30 00:21:55,329 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-30 00:21:55,333 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-30 00:21:55,340 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-30 00:21:55,343 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-30 00:21:55,350 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-30 00:21:55,354 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-30 00:21:55,361 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-30 00:21:55,366 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-30 00:21:55,372 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-30 00:21:55,374 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-30 00:21:55,376 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-30 00:21:55,379 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-30 00:21:55,383 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-30 00:21:55,385 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-30 00:21:55,387 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-30 00:21:55,389 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-30 00:21:55,405 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-30 00:21:55,415 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-30 00:21:55,436 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-30 00:21:55,753 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:21:55,753 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:55,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:55,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:55,761 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:55,761 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:55,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:55,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:55,786 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:55,786 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=7} Honda state: {~r_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:55,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:55,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:55,810 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:55,810 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:55,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:55,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:55,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:21:55,836 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:55,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:21:55,858 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:55,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:21:55,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:21:55,886 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:21:55,906 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:21:55,906 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:21:55,906 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:21:55,906 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:21:55,906 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:21:55,906 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:55,906 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:21:55,906 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:21:55,906 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2020-11-30 00:21:55,906 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:21:55,906 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:21:55,909 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-30 00:21:55,918 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-30 00:21:55,921 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-30 00:21:55,928 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-30 00:21:55,931 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-30 00:21:55,939 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-30 00:21:55,947 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-30 00:21:55,950 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-30 00:21:55,954 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-30 00:21:55,957 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-30 00:21:55,962 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-30 00:21:55,968 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-30 00:21:55,973 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-30 00:21:55,975 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-30 00:21:55,980 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-30 00:21:55,982 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-30 00:21:55,990 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-30 00:21:55,993 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-30 00:21:55,997 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-30 00:21:56,000 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-30 00:21:56,004 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-30 00:21:56,006 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-30 00:21:56,008 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-30 00:21:56,013 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-30 00:21:56,015 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-30 00:21:56,017 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-30 00:21:56,254 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:21:56,254 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:56,275 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-30 00:21:56,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:56,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:56,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:56,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:56,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:56,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:56,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:21:56,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:56,303 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-30 00:21:56,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:56,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:56,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:56,305 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-11-30 00:21:56,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:56,305 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-11-30 00:21:56,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:21:56,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:56,330 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-30 00:21:56,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:21:56,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:21:56,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:21:56,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:21:56,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:21:56,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:21:56,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:21:56,334 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:21:56,336 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 00:21:56,336 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_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:21:56,344 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:21:56,345 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:21:56,345 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:21:56,345 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2020-11-30 00:21:56,364 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:21:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:56,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:21:56,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:21:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:56,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:21:56,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:21:56,490 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-30 00:21:56,491 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-11-30 00:21:56,491 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2558 states and 4217 transitions. cyclomatic complexity: 1671 Second operand 5 states. [2020-11-30 00:21:56,634 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2558 states and 4217 transitions. cyclomatic complexity: 1671. Second operand 5 states. Result 6901 states and 11356 transitions. Complement of second has 5 states. [2020-11-30 00:21:56,635 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-30 00:21:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-11-30 00:21:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-11-30 00:21:56,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 25 letters. Loop has 29 letters. [2020-11-30 00:21:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:21:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 54 letters. Loop has 29 letters. [2020-11-30 00:21:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:21:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 25 letters. Loop has 58 letters. [2020-11-30 00:21:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:21:56,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6901 states and 11356 transitions. [2020-11-30 00:21:56,686 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2732 [2020-11-30 00:21:56,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6901 states to 6901 states and 11356 transitions. [2020-11-30 00:21:56,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2804 [2020-11-30 00:21:56,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2841 [2020-11-30 00:21:56,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6901 states and 11356 transitions. [2020-11-30 00:21:56,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:56,748 INFO L691 BuchiCegarLoop]: Abstraction has 6901 states and 11356 transitions. [2020-11-30 00:21:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states and 11356 transitions. [2020-11-30 00:21:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 6864. [2020-11-30 00:21:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6864 states. [2020-11-30 00:21:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6864 states to 6864 states and 11294 transitions. [2020-11-30 00:21:56,907 INFO L714 BuchiCegarLoop]: Abstraction has 6864 states and 11294 transitions. [2020-11-30 00:21:56,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:21:56,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:21:56,910 INFO L87 Difference]: Start difference. First operand 6864 states and 11294 transitions. Second operand 3 states. [2020-11-30 00:21:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:56,963 INFO L93 Difference]: Finished difference Result 5433 states and 8937 transitions. [2020-11-30 00:21:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:21:56,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5433 states and 8937 transitions. [2020-11-30 00:21:56,990 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2130 [2020-11-30 00:21:57,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5433 states to 5433 states and 8937 transitions. [2020-11-30 00:21:57,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2200 [2020-11-30 00:21:57,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2200 [2020-11-30 00:21:57,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5433 states and 8937 transitions. [2020-11-30 00:21:57,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:57,045 INFO L691 BuchiCegarLoop]: Abstraction has 5433 states and 8937 transitions. [2020-11-30 00:21:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states and 8937 transitions. [2020-11-30 00:21:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 5225. [2020-11-30 00:21:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5225 states. [2020-11-30 00:21:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 8599 transitions. [2020-11-30 00:21:57,241 INFO L714 BuchiCegarLoop]: Abstraction has 5225 states and 8599 transitions. [2020-11-30 00:21:57,241 INFO L594 BuchiCegarLoop]: Abstraction has 5225 states and 8599 transitions. [2020-11-30 00:21:57,241 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-30 00:21:57,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5225 states and 8599 transitions. [2020-11-30 00:21:57,262 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2059 [2020-11-30 00:21:57,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:57,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:57,263 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] [2020-11-30 00:21:57,263 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:21:57,263 INFO L794 eck$LassoCheckResult]: Stem: 37949#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 37731#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 37732#L408 assume !(1 == ~c_req_up~0); 37845#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 37862#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 37917#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 37918#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 37994#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 37770#L439-1 assume !(0 == ~e_f~0); 37771#L444-1 assume !(0 == ~e_g~0); 37911#L449-1 assume !(0 == ~e_e~0); 37912#L454-1 assume !(0 == ~e_c~0); 37993#L459-1 assume !(0 == ~e_wl~0); 37759#L464-1 assume !(1 == ~wl_pc~0); 37760#L476 assume !(2 == ~wl_pc~0); 37838#L477 assume !(1 == ~c1_pc~0); 37837#L487 assume !(1 == ~c2_pc~0); 37988#L496 assume !(1 == ~wb_pc~0); 37762#L505 assume !(1 == ~e_c~0); 37763#L514-1 assume !(1 == ~e_e~0); 37982#L519-1 assume !(1 == ~e_f~0); 37826#L524-1 assume !(1 == ~e_g~0); 37827#L529-1 assume !(1 == ~e_c~0); 37898#L534-1 assume !(1 == ~e_wl~0); 38937#L676-1 assume !false; 38938#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 40891#L381 [2020-11-30 00:21:57,263 INFO L796 eck$LassoCheckResult]: Loop: 40891#L381 assume !false; 42457#L299 assume 0 == ~wl_st~0; 42456#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 41945#L325 assume !(0 != eval_~tmp~0); 41946#L321 assume !(0 == ~c1_st~0); 42469#L336 assume !(0 == ~c2_st~0); 42463#L351 assume !(0 == ~wb_st~0); 42460#L366 assume !(0 == ~r_st~0); 40891#L381 [2020-11-30 00:21:57,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:57,264 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2020-11-30 00:21:57,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:57,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077775662] [2020-11-30 00:21:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:57,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:57,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:57,296 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:57,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1293189375, now seen corresponding path program 1 times [2020-11-30 00:21:57,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:57,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955663764] [2020-11-30 00:21:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:57,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:57,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:57,305 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:57,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:57,306 INFO L82 PathProgramCache]: Analyzing trace with hash 374234871, now seen corresponding path program 1 times [2020-11-30 00:21:57,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:57,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463735685] [2020-11-30 00:21:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:57,357 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-30 00:21:57,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463735685] [2020-11-30 00:21:57,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:57,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:57,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718226733] [2020-11-30 00:21:57,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:57,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:21:57,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:21:57,396 INFO L87 Difference]: Start difference. First operand 5225 states and 8599 transitions. cyclomatic complexity: 3401 Second operand 3 states. [2020-11-30 00:21:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:57,468 INFO L93 Difference]: Finished difference Result 8215 states and 13416 transitions. [2020-11-30 00:21:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:21:57,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8215 states and 13416 transitions. [2020-11-30 00:21:57,510 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3271 [2020-11-30 00:21:57,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8215 states to 8215 states and 13416 transitions. [2020-11-30 00:21:57,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3349 [2020-11-30 00:21:57,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3349 [2020-11-30 00:21:57,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8215 states and 13416 transitions. [2020-11-30 00:21:57,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:57,637 INFO L691 BuchiCegarLoop]: Abstraction has 8215 states and 13416 transitions. [2020-11-30 00:21:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8215 states and 13416 transitions. [2020-11-30 00:21:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8215 to 8215. [2020-11-30 00:21:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8215 states. [2020-11-30 00:21:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8215 states to 8215 states and 13416 transitions. [2020-11-30 00:21:57,792 INFO L714 BuchiCegarLoop]: Abstraction has 8215 states and 13416 transitions. [2020-11-30 00:21:57,793 INFO L594 BuchiCegarLoop]: Abstraction has 8215 states and 13416 transitions. [2020-11-30 00:21:57,793 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-30 00:21:57,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8215 states and 13416 transitions. [2020-11-30 00:21:57,822 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3271 [2020-11-30 00:21:57,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:57,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:57,823 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] [2020-11-30 00:21:57,823 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:21:57,823 INFO L794 eck$LassoCheckResult]: Stem: 51408#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 51172#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 51173#L408 assume !(1 == ~c_req_up~0); 51301#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 51315#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 51370#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 51371#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 51450#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 51221#L439-1 assume !(0 == ~e_f~0); 51222#L444-1 assume !(0 == ~e_g~0); 51361#L449-1 assume !(0 == ~e_e~0); 51362#L454-1 assume !(0 == ~e_c~0); 51449#L459-1 assume !(0 == ~e_wl~0); 51210#L464-1 assume !(1 == ~wl_pc~0); 51211#L476 assume !(2 == ~wl_pc~0); 51292#L477 assume !(1 == ~c1_pc~0); 51291#L487 assume !(1 == ~c2_pc~0); 51444#L496 assume !(1 == ~wb_pc~0); 51213#L505 assume !(1 == ~e_c~0); 51214#L514-1 assume !(1 == ~e_e~0); 51437#L519-1 assume !(1 == ~e_f~0); 51280#L524-1 assume !(1 == ~e_g~0); 51281#L529-1 assume !(1 == ~e_c~0); 51351#L534-1 assume !(1 == ~e_wl~0); 51397#L676-1 assume !false; 53393#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 55675#L381 [2020-11-30 00:21:57,823 INFO L796 eck$LassoCheckResult]: Loop: 55675#L381 assume !false; 58317#L299 assume 0 == ~wl_st~0; 58315#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 58312#L325 assume !(0 != eval_~tmp~0); 58313#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 58424#L340 assume !(0 != eval_~tmp___0~0); 58333#L336 assume !(0 == ~c2_st~0); 58327#L351 assume !(0 == ~wb_st~0); 58323#L366 assume !(0 == ~r_st~0); 55675#L381 [2020-11-30 00:21:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:57,824 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2020-11-30 00:21:57,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:57,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103778949] [2020-11-30 00:21:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:57,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:57,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:57,847 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1383392736, now seen corresponding path program 1 times [2020-11-30 00:21:57,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:57,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049101712] [2020-11-30 00:21:57,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:57,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:57,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:57,855 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:57,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1334393112, now seen corresponding path program 1 times [2020-11-30 00:21:57,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:57,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587128963] [2020-11-30 00:21:57,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:57,899 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-30 00:21:57,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587128963] [2020-11-30 00:21:57,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:57,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:57,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8555257] [2020-11-30 00:21:57,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:57,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:21:57,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:21:57,944 INFO L87 Difference]: Start difference. First operand 8215 states and 13416 transitions. cyclomatic complexity: 5228 Second operand 3 states. [2020-11-30 00:21:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:58,108 INFO L93 Difference]: Finished difference Result 12970 states and 20881 transitions. [2020-11-30 00:21:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:21:58,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12970 states and 20881 transitions. [2020-11-30 00:21:58,177 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5188 [2020-11-30 00:21:58,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12970 states to 12970 states and 20881 transitions. [2020-11-30 00:21:58,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5332 [2020-11-30 00:21:58,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5332 [2020-11-30 00:21:58,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12970 states and 20881 transitions. [2020-11-30 00:21:58,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:58,240 INFO L691 BuchiCegarLoop]: Abstraction has 12970 states and 20881 transitions. [2020-11-30 00:21:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states and 20881 transitions. [2020-11-30 00:21:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12970. [2020-11-30 00:21:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12970 states. [2020-11-30 00:21:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12970 states to 12970 states and 20881 transitions. [2020-11-30 00:21:58,525 INFO L714 BuchiCegarLoop]: Abstraction has 12970 states and 20881 transitions. [2020-11-30 00:21:58,525 INFO L594 BuchiCegarLoop]: Abstraction has 12970 states and 20881 transitions. [2020-11-30 00:21:58,525 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-30 00:21:58,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12970 states and 20881 transitions. [2020-11-30 00:21:58,564 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5188 [2020-11-30 00:21:58,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:58,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:58,565 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] [2020-11-30 00:21:58,565 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:21:58,571 INFO L794 eck$LassoCheckResult]: Stem: 72603#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 72374#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 72375#L408 assume !(1 == ~c_req_up~0); 72350#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 72499#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 72500#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 72619#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 72620#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 72639#L439-1 assume !(0 == ~e_f~0); 72491#L444-1 assume !(0 == ~e_g~0); 72492#L449-1 assume !(0 == ~e_e~0); 72613#L454-1 assume !(0 == ~e_c~0); 72614#L459-1 assume !(0 == ~e_wl~0); 72638#L464-1 assume !(1 == ~wl_pc~0); 72610#L476 assume !(2 == ~wl_pc~0); 72611#L477 assume !(1 == ~c1_pc~0); 72609#L487 assume !(1 == ~c2_pc~0); 72395#L496 assume !(1 == ~wb_pc~0); 72544#L505 assume !(1 == ~e_c~0); 72636#L514-1 assume !(1 == ~e_e~0); 72637#L519-1 assume !(1 == ~e_f~0); 72475#L524-1 assume !(1 == ~e_g~0); 72476#L529-1 assume !(1 == ~e_c~0); 72546#L534-1 assume !(1 == ~e_wl~0); 72594#L676-1 assume !false; 76554#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 81284#L381 [2020-11-30 00:21:58,571 INFO L796 eck$LassoCheckResult]: Loop: 81284#L381 assume !false; 82530#L299 assume 0 == ~wl_st~0; 82529#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 82527#L325 assume !(0 != eval_~tmp~0); 82528#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 82563#L340 assume !(0 != eval_~tmp___0~0); 81294#L336 assume !(0 == ~c2_st~0); 81296#L351 assume !(0 == ~wb_st~0); 82533#L366 assume !(0 == ~r_st~0); 81284#L381 [2020-11-30 00:21:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2020-11-30 00:21:58,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:58,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71185057] [2020-11-30 00:21:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:58,598 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-30 00:21:58,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71185057] [2020-11-30 00:21:58,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:58,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:58,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257150505] [2020-11-30 00:21:58,599 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:21:58,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1383392736, now seen corresponding path program 2 times [2020-11-30 00:21:58,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:58,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38523322] [2020-11-30 00:21:58,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:58,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:58,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:58,605 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:58,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:58,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:21:58,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:21:58,661 INFO L87 Difference]: Start difference. First operand 12970 states and 20881 transitions. cyclomatic complexity: 7938 Second operand 3 states. [2020-11-30 00:21:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:58,827 INFO L93 Difference]: Finished difference Result 12918 states and 20794 transitions. [2020-11-30 00:21:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:21:58,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12918 states and 20794 transitions. [2020-11-30 00:21:58,900 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5188 [2020-11-30 00:21:58,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12918 states to 12918 states and 20794 transitions. [2020-11-30 00:21:58,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5282 [2020-11-30 00:21:58,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5282 [2020-11-30 00:21:58,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12918 states and 20794 transitions. [2020-11-30 00:21:58,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:58,966 INFO L691 BuchiCegarLoop]: Abstraction has 12918 states and 20794 transitions. [2020-11-30 00:21:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12918 states and 20794 transitions. [2020-11-30 00:21:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12918 to 12918. [2020-11-30 00:21:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12918 states. [2020-11-30 00:21:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12918 states to 12918 states and 20794 transitions. [2020-11-30 00:21:59,258 INFO L714 BuchiCegarLoop]: Abstraction has 12918 states and 20794 transitions. [2020-11-30 00:21:59,258 INFO L594 BuchiCegarLoop]: Abstraction has 12918 states and 20794 transitions. [2020-11-30 00:21:59,258 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-30 00:21:59,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12918 states and 20794 transitions. [2020-11-30 00:21:59,297 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5188 [2020-11-30 00:21:59,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:21:59,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:21:59,297 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] [2020-11-30 00:21:59,298 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:21:59,298 INFO L794 eck$LassoCheckResult]: Stem: 98478#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 98257#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 98258#L408 assume !(1 == ~c_req_up~0); 98244#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 98390#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 98443#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 98444#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 98519#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 98518#L439-1 assume !(0 == ~e_f~0); 98517#L444-1 assume !(0 == ~e_g~0); 98516#L449-1 assume !(0 == ~e_e~0); 98515#L454-1 assume !(0 == ~e_c~0); 98514#L459-1 assume !(0 == ~e_wl~0); 98513#L464-1 assume !(1 == ~wl_pc~0); 98510#L476 assume !(2 == ~wl_pc~0); 98509#L477 assume !(1 == ~c1_pc~0); 98482#L487 assume !(1 == ~c2_pc~0); 98288#L496 assume !(1 == ~wb_pc~0); 98423#L505 assume !(1 == ~e_c~0); 98501#L514-1 assume !(1 == ~e_e~0); 98502#L519-1 assume !(1 == ~e_f~0); 98369#L524-1 assume !(1 == ~e_g~0); 98370#L529-1 assume !(1 == ~e_c~0); 98425#L534-1 assume !(1 == ~e_wl~0); 98468#L676-1 assume !false; 101949#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 106297#L381 [2020-11-30 00:21:59,298 INFO L796 eck$LassoCheckResult]: Loop: 106297#L381 assume !false; 107295#L299 assume 0 == ~wl_st~0; 107291#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 107288#L325 assume !(0 != eval_~tmp~0); 107289#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 108970#L340 assume !(0 != eval_~tmp___0~0); 107315#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 107311#L355 assume !(0 != eval_~tmp___1~0); 107308#L351 assume !(0 == ~wb_st~0); 107303#L366 assume !(0 == ~r_st~0); 106297#L381 [2020-11-30 00:21:59,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:59,299 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2020-11-30 00:21:59,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:59,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840302277] [2020-11-30 00:21:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:59,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:59,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:59,333 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash -66118102, now seen corresponding path program 1 times [2020-11-30 00:21:59,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:59,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105852994] [2020-11-30 00:21:59,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:59,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:21:59,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:21:59,340 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:21:59,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:59,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1581866530, now seen corresponding path program 1 times [2020-11-30 00:21:59,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:21:59,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075085783] [2020-11-30 00:21:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:21:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:59,368 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-30 00:21:59,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075085783] [2020-11-30 00:21:59,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:59,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:21:59,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531660576] [2020-11-30 00:21:59,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:21:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:21:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:21:59,424 INFO L87 Difference]: Start difference. First operand 12918 states and 20794 transitions. cyclomatic complexity: 7903 Second operand 3 states. [2020-11-30 00:21:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:59,538 INFO L93 Difference]: Finished difference Result 22109 states and 35110 transitions. [2020-11-30 00:21:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:21:59,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22109 states and 35110 transitions. [2020-11-30 00:21:59,772 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 8906 [2020-11-30 00:21:59,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22109 states to 22109 states and 35110 transitions. [2020-11-30 00:21:59,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9032 [2020-11-30 00:21:59,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9032 [2020-11-30 00:21:59,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22109 states and 35110 transitions. [2020-11-30 00:21:59,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:21:59,892 INFO L691 BuchiCegarLoop]: Abstraction has 22109 states and 35110 transitions. [2020-11-30 00:21:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22109 states and 35110 transitions. [2020-11-30 00:22:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22109 to 22109. [2020-11-30 00:22:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22109 states. [2020-11-30 00:22:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22109 states to 22109 states and 35110 transitions. [2020-11-30 00:22:00,234 INFO L714 BuchiCegarLoop]: Abstraction has 22109 states and 35110 transitions. [2020-11-30 00:22:00,234 INFO L594 BuchiCegarLoop]: Abstraction has 22109 states and 35110 transitions. [2020-11-30 00:22:00,234 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-11-30 00:22:00,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22109 states and 35110 transitions. [2020-11-30 00:22:00,298 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 8906 [2020-11-30 00:22:00,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:22:00,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:22:00,304 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] [2020-11-30 00:22:00,304 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:00,305 INFO L794 eck$LassoCheckResult]: Stem: 133521#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 133296#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 133297#L408 assume !(1 == ~c_req_up~0); 133425#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 133437#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 133487#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 133488#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 133565#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 133345#L439-1 assume !(0 == ~e_f~0); 133346#L444-1 assume !(0 == ~e_g~0); 133481#L449-1 assume !(0 == ~e_e~0); 133482#L454-1 assume !(0 == ~e_c~0); 133564#L459-1 assume !(0 == ~e_wl~0); 133332#L464-1 assume !(1 == ~wl_pc~0); 133333#L476 assume !(2 == ~wl_pc~0); 133418#L477 assume !(1 == ~c1_pc~0); 133417#L487 assume !(1 == ~c2_pc~0); 133559#L496 assume !(1 == ~wb_pc~0); 133335#L505 assume !(1 == ~e_c~0); 133336#L514-1 assume !(1 == ~e_e~0); 133552#L519-1 assume !(1 == ~e_f~0); 133404#L524-1 assume !(1 == ~e_g~0); 133405#L529-1 assume !(1 == ~e_c~0); 133473#L534-1 assume !(1 == ~e_wl~0); 133511#L676-1 assume !false; 138527#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 145219#L381 [2020-11-30 00:22:00,305 INFO L796 eck$LassoCheckResult]: Loop: 145219#L381 assume !false; 151837#L299 assume 0 == ~wl_st~0; 151835#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 151831#L325 assume !(0 != eval_~tmp~0); 151829#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 151783#L340 assume !(0 != eval_~tmp___0~0); 151827#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 151813#L355 assume !(0 != eval_~tmp___1~0); 151826#L351 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 151843#L370 assume !(0 != eval_~tmp___2~0); 151842#L366 assume !(0 == ~r_st~0); 145219#L381 [2020-11-30 00:22:00,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:00,306 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2020-11-30 00:22:00,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:00,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525427287] [2020-11-30 00:22:00,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:00,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:00,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:00,332 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:00,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2049695563, now seen corresponding path program 1 times [2020-11-30 00:22:00,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:00,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757830416] [2020-11-30 00:22:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:00,336 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:00,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:00,339 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:00,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1793187773, now seen corresponding path program 1 times [2020-11-30 00:22:00,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:00,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413016762] [2020-11-30 00:22:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:00,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:00,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:00,369 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:01,553 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 200 DAG size of output: 157 [2020-11-30 00:22:01,767 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-30 00:22:01,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 12:22:01 BoogieIcfgContainer [2020-11-30 00:22:01,799 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 00:22:01,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:22:01,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:22:01,800 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:22:01,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:21:47" (3/4) ... [2020-11-30 00:22:01,803 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-30 00:22:01,845 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_012e5ed0-a223-47aa-8892-7d50e8b2f918/bin/uautomizer/witness.graphml [2020-11-30 00:22:01,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:22:01,846 INFO L168 Benchmark]: Toolchain (without parser) took 15655.15 ms. Allocated memory was 136.3 MB in the beginning and 1.1 GB in the end (delta: 977.3 MB). Free memory was 109.2 MB in the beginning and 847.2 MB in the end (delta: -737.9 MB). Peak memory consumption was 239.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:01,847 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 90.2 MB. Free memory is still 50.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:22:01,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.42 ms. Allocated memory is still 136.3 MB. Free memory was 108.6 MB in the beginning and 109.5 MB in the end (delta: -866.6 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:01,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.30 ms. Allocated memory is still 136.3 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:01,848 INFO L168 Benchmark]: Boogie Preprocessor took 73.03 ms. Allocated memory is still 136.3 MB. Free memory was 107.4 MB in the beginning and 105.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:01,848 INFO L168 Benchmark]: RCFGBuilder took 947.07 ms. Allocated memory is still 136.3 MB. Free memory was 105.3 MB in the beginning and 64.5 MB in the end (delta: 40.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:01,849 INFO L168 Benchmark]: BuchiAutomizer took 14023.26 ms. Allocated memory was 136.3 MB in the beginning and 1.1 GB in the end (delta: 977.3 MB). Free memory was 64.5 MB in the beginning and 850.3 MB in the end (delta: -785.8 MB). Peak memory consumption was 346.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:01,849 INFO L168 Benchmark]: Witness Printer took 45.37 ms. Allocated memory is still 1.1 GB. Free memory was 850.3 MB in the beginning and 847.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:01,851 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.91 ms. Allocated memory is still 90.2 MB. Free memory is still 50.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 470.42 ms. Allocated memory is still 136.3 MB. Free memory was 108.6 MB in the beginning and 109.5 MB in the end (delta: -866.6 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.30 ms. Allocated memory is still 136.3 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 73.03 ms. Allocated memory is still 136.3 MB. Free memory was 107.4 MB in the beginning and 105.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 947.07 ms. Allocated memory is still 136.3 MB. Free memory was 105.3 MB in the beginning and 64.5 MB in the end (delta: 40.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 14023.26 ms. Allocated memory was 136.3 MB in the beginning and 1.1 GB in the end (delta: 977.3 MB). Free memory was 64.5 MB in the beginning and 850.3 MB in the end (delta: -785.8 MB). Peak memory consumption was 346.1 MB. Max. memory is 16.1 GB. * Witness Printer took 45.37 ms. Allocated memory is still 1.1 GB. Free memory was 850.3 MB in the beginning and 847.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. 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 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 22109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.9s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 8.2s. Construction of modules took 0.6s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 15. Automata minimization 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 733 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had 22109 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4465 SDtfs, 4029 SDslu, 2543 SDs, 0 SdLazy, 370 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc3 concLT1 SILN1 SILU0 SILI6 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf170 smp87 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 298]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {wb_st=0, NULL=0, NULL=1, c2_st=0, tmp=0, e_c=2, e_e=2, e_p_in=0, kernel_st=1, t_b=0, tmp___2=0, wb_pc=0, tmp___0=0, wb_i=1, c_t=0, NULL=0, NULL=0, c=0, wl_st=0, c2_pc=0, r_i=0, e_f=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ae4985f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e148cdc=0, NULL=0, r_st=2, __retres1=0, p_out=0, NULL=3, processed=0, \result=0, wl_pc=0, e_wl=2, tmp___1=0, data=0, p_in=0, tmp___3=0, c_req_up=0, NULL=2, wl_i=1, NULL=0, c1_st=0, NULL=4, c1_i=1, c2_i=1, d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47abd8d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6621daa1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75d8338c=0, e_g=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L404] int kernel_st ; [L407] kernel_st = 0 [L408] COND FALSE !((int )c_req_up == 1) [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 [L444] COND FALSE !((int )e_f == 0) [L449] COND FALSE !((int )e_g == 0) [L454] COND FALSE !((int )e_e == 0) [L459] COND FALSE !((int )e_c == 0) [L464] COND FALSE !((int )e_wl == 0) [L469] COND FALSE !((int )wl_pc == 1) [L477] COND FALSE !((int )wl_pc == 2) [L487] COND FALSE !((int )c1_pc == 1) [L496] COND FALSE !((int )c2_pc == 1) [L505] COND FALSE !((int )wb_pc == 1) [L514] COND FALSE !((int )e_c == 1) [L519] COND FALSE !((int )e_e == 1) [L524] COND FALSE !((int )e_f == 1) [L529] COND FALSE !((int )e_g == 1) [L534] COND FALSE !((int )e_c == 1) [L539] COND FALSE !((int )e_wl == 1) [L545] COND TRUE 1 [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...