./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext.i --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_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/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 8dfe6e301265e265404ce5be2c9f54235040b69e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:46:51,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:46:51,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:46:51,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:46:51,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:46:51,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:46:51,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:46:51,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:46:51,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:46:51,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:46:51,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:46:51,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:46:51,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:46:51,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:46:51,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:46:51,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:46:51,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:46:51,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:46:51,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:46:51,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:46:51,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:46:51,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:46:51,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:46:51,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:46:51,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:46:51,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:46:51,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:46:51,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:46:51,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:46:51,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:46:51,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:46:51,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:46:51,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:46:51,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:46:51,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:46:51,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:46:51,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:46:51,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:46:51,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:46:51,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:46:51,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:46:51,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 00:46:51,542 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:46:51,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:46:51,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:46:51,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:46:51,545 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:46:51,545 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:46:51,546 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:46:51,546 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:46:51,546 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:46:51,546 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:46:51,547 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:46:51,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:46:51,547 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:46:51,548 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:46:51,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:46:51,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:46:51,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:46:51,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:46:51,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:46:51,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:46:51,550 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:46:51,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:46:51,551 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:46:51,551 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:46:51,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:46:51,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:46:51,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:46:51,552 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:46:51,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:46:51,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:46:51,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:46:51,554 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:46:51,555 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:46:51,555 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_80808a17-8110-439d-bd85-c4a3544c8d2b/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_80808a17-8110-439d-bd85-c4a3544c8d2b/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 -> 8dfe6e301265e265404ce5be2c9f54235040b69e [2020-11-30 00:46:51,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:46:51,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:46:51,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:46:51,938 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:46:51,939 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:46:51,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/simple-ext.i [2020-11-30 00:46:52,048 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/data/3acc33aa1/9988a81720d94b0da8ad763fa3908640/FLAG4526ed9ee [2020-11-30 00:46:52,817 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:46:52,818 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/sv-benchmarks/c/list-ext-properties/simple-ext.i [2020-11-30 00:46:52,833 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/data/3acc33aa1/9988a81720d94b0da8ad763fa3908640/FLAG4526ed9ee [2020-11-30 00:46:53,087 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/data/3acc33aa1/9988a81720d94b0da8ad763fa3908640 [2020-11-30 00:46:53,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:46:53,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:46:53,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:46:53,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:46:53,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:46:53,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:46:53" (1/1) ... [2020-11-30 00:46:53,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d661ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53, skipping insertion in model container [2020-11-30 00:46:53,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:46:53" (1/1) ... [2020-11-30 00:46:53,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:46:53,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:46:53,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:46:53,799 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:46:53,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:46:53,961 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:46:53,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53 WrapperNode [2020-11-30 00:46:53,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:46:53,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:46:53,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:46:53,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:46:53,979 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:46:53" (1/1) ... [2020-11-30 00:46:54,016 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:46:53" (1/1) ... [2020-11-30 00:46:54,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:46:54,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:46:54,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:46:54,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:46:54,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53" (1/1) ... [2020-11-30 00:46:54,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53" (1/1) ... [2020-11-30 00:46:54,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53" (1/1) ... [2020-11-30 00:46:54,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53" (1/1) ... [2020-11-30 00:46:54,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53" (1/1) ... [2020-11-30 00:46:54,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53" (1/1) ... [2020-11-30 00:46:54,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53" (1/1) ... [2020-11-30 00:46:54,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:46:54,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:46:54,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:46:54,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:46:54,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/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:46:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:46:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:46:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 00:46:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 00:46:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:46:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 00:46:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:46:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:46:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:46:54,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:46:54,857 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:46:54,857 INFO L298 CfgBuilder]: Removed 13 assume(true) statements. [2020-11-30 00:46:54,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:46:54 BoogieIcfgContainer [2020-11-30 00:46:54,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:46:54,862 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:46:54,863 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:46:54,867 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:46:54,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:46:54,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:46:53" (1/3) ... [2020-11-30 00:46:54,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70669f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:46:54, skipping insertion in model container [2020-11-30 00:46:54,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:46:54,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:53" (2/3) ... [2020-11-30 00:46:54,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70669f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:46:54, skipping insertion in model container [2020-11-30 00:46:54,874 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:46:54,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:46:54" (3/3) ... [2020-11-30 00:46:54,877 INFO L373 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2020-11-30 00:46:54,952 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:46:54,952 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:46:54,952 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:46:54,952 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:46:54,952 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:46:54,952 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:46:54,953 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:46:54,953 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:46:54,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-11-30 00:46:54,999 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2020-11-30 00:46:55,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:55,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:55,007 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 00:46:55,007 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-11-30 00:46:55,007 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:46:55,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-11-30 00:46:55,015 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2020-11-30 00:46:55,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:55,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:55,017 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 00:46:55,018 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-11-30 00:46:55,028 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 13#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 11#L533true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L525true [2020-11-30 00:46:55,028 INFO L796 eck$LassoCheckResult]: Loop: 5#L525true assume true; 5#L525true [2020-11-30 00:46:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-11-30 00:46:55,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:55,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575410183] [2020-11-30 00:46:55,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:55,253 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:46:55,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575410183] [2020-11-30 00:46:55,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:46:55,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:46:55,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476319907] [2020-11-30 00:46:55,262 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:46:55,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash 108, now seen corresponding path program 1 times [2020-11-30 00:46:55,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:55,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281313884] [2020-11-30 00:46:55,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:55,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:55,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:55,297 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:55,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:55,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:46:55,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:46:55,339 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-11-30 00:46:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:55,377 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-11-30 00:46:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:46:55,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2020-11-30 00:46:55,382 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-30 00:46:55,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2020-11-30 00:46:55,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-11-30 00:46:55,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-11-30 00:46:55,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2020-11-30 00:46:55,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:46:55,390 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-11-30 00:46:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2020-11-30 00:46:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-30 00:46:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-30 00:46:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-11-30 00:46:55,423 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-11-30 00:46:55,423 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-11-30 00:46:55,423 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:46:55,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-11-30 00:46:55,428 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-30 00:46:55,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:55,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:55,429 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-30 00:46:55,429 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:46:55,429 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 62#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 60#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 61#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 56#L537-2 [2020-11-30 00:46:55,430 INFO L796 eck$LassoCheckResult]: Loop: 56#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 58#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 64#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 56#L537-2 [2020-11-30 00:46:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2020-11-30 00:46:55,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:55,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64052391] [2020-11-30 00:46:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:55,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:55,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:55,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:55,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:55,541 INFO L82 PathProgramCache]: Analyzing trace with hash 48852, now seen corresponding path program 1 times [2020-11-30 00:46:55,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:55,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559783248] [2020-11-30 00:46:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:55,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:55,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:55,621 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:55,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1807773776, now seen corresponding path program 1 times [2020-11-30 00:46:55,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:55,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100956980] [2020-11-30 00:46:55,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:55,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:55,702 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:55,722 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:56,280 WARN L193 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2020-11-30 00:46:56,354 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:46:56,560 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-30 00:46:56,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:46:56,573 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:46:56,701 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-30 00:46:56,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:46:56,705 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 00:46:56,708 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2020-11-30 00:46:56,856 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-30 00:46:57,152 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2020-11-30 00:46:57,294 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-30 00:46:57,306 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:46:57,306 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:46:57,307 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:46:57,307 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:46:57,307 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:46:57,307 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:57,308 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:46:57,308 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:46:57,308 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2020-11-30 00:46:57,308 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:46:57,309 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:46:57,356 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:46:57,370 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:46:57,766 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-11-30 00:46:57,964 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-11-30 00:46:57,965 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:46:57,970 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:46:57,974 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:46:57,979 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:46:57,983 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:46:57,988 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:46:57,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:46:57,998 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:46:58,001 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:46:58,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:46:58,009 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:46:58,014 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:46:58,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:46:58,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:46:58,039 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:46:58,043 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:46:58,048 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:46:58,052 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:46:58,679 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2020-11-30 00:46:58,855 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:46:58,861 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/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) [2020-11-30 00:46:58,893 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:46:58,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:58,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:46:58,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:58,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:58,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:58,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:46:58,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:58,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/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:46:58,979 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:46:58,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:58,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:58,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:58,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:58,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:58,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:59,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/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:46:59,064 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:46:59,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:59,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:59,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:59,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:59,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:59,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:59,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:46:59,132 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:46:59,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:59,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:59,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:59,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:59,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:59,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:59,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:59,181 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:46:59,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:59,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:59,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:59,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:59,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:59,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:46:59,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/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:46:59,261 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:46:59,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:59,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:59,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:59,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:59,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:59,271 INFO L402 nArgumentSynthesizer]: A total of 2 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:46:59,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/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:46:59,317 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:46:59,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:46:59,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:46:59,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:46:59,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:46:59,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:46:59,325 INFO L402 nArgumentSynthesizer]: A total of 2 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:46:59,344 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:46:59,498 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-11-30 00:46:59,498 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:46:59,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:46:59,570 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:46:59,570 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:46:59,571 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2020-11-30 00:46:59,643 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-11-30 00:46:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:59,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:46:59,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:59,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:46:59,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:46:59,798 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:46:59,806 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:46:59,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-30 00:46:59,871 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 7 states. [2020-11-30 00:46:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:46:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:46:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-11-30 00:46:59,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2020-11-30 00:46:59,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:59,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2020-11-30 00:46:59,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:59,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2020-11-30 00:46:59,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:46:59,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-11-30 00:46:59,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-11-30 00:46:59,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2020-11-30 00:46:59,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-30 00:46:59,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-30 00:46:59,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-11-30 00:46:59,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:46:59,888 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-11-30 00:46:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-11-30 00:46:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-11-30 00:46:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-30 00:46:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-11-30 00:46:59,893 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-11-30 00:46:59,893 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-11-30 00:46:59,893 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:46:59,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-11-30 00:46:59,895 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-11-30 00:46:59,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:46:59,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:46:59,897 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:46:59,897 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:46:59,898 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 174#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 172#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 173#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 166#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 167#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 162#L549-2 [2020-11-30 00:46:59,898 INFO L796 eck$LassoCheckResult]: Loop: 162#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 164#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 161#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 162#L549-2 [2020-11-30 00:46:59,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:59,899 INFO L82 PathProgramCache]: Analyzing trace with hash 889599219, now seen corresponding path program 1 times [2020-11-30 00:46:59,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:59,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188847480] [2020-11-30 00:46:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:59,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:46:59,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:46:59,977 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:46:59,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:59,983 INFO L82 PathProgramCache]: Analyzing trace with hash 69961, now seen corresponding path program 1 times [2020-11-30 00:46:59,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:59,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78656754] [2020-11-30 00:46:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,014 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,017 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:00,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2102157079, now seen corresponding path program 1 times [2020-11-30 00:47:00,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609157365] [2020-11-30 00:47:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:00,248 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:47:00,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609157365] [2020-11-30 00:47:00,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:00,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:47:00,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876652013] [2020-11-30 00:47:00,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:00,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:47:00,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:00,391 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-11-30 00:47:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:00,550 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-11-30 00:47:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:00,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2020-11-30 00:47:00,554 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2020-11-30 00:47:00,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2020-11-30 00:47:00,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-11-30 00:47:00,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-11-30 00:47:00,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2020-11-30 00:47:00,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:47:00,562 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-11-30 00:47:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2020-11-30 00:47:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2020-11-30 00:47:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-30 00:47:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-11-30 00:47:00,568 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-11-30 00:47:00,569 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-11-30 00:47:00,569 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:47:00,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-11-30 00:47:00,571 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-11-30 00:47:00,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:47:00,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:47:00,572 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:47:00,572 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-11-30 00:47:00,573 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 235#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 233#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 234#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 226#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 229#L540 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 232#L525-1 [2020-11-30 00:47:00,573 INFO L796 eck$LassoCheckResult]: Loop: 232#L525-1 assume true; 232#L525-1 [2020-11-30 00:47:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash 889599272, now seen corresponding path program 1 times [2020-11-30 00:47:00,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991888955] [2020-11-30 00:47:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:00,640 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:47:00,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991888955] [2020-11-30 00:47:00,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:00,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:47:00,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826831802] [2020-11-30 00:47:00,642 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:47:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash 109, now seen corresponding path program 1 times [2020-11-30 00:47:00,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682985860] [2020-11-30 00:47:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,653 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:00,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:00,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:00,663 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-11-30 00:47:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:00,681 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-11-30 00:47:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:00,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2020-11-30 00:47:00,684 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-11-30 00:47:00,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2020-11-30 00:47:00,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-30 00:47:00,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-30 00:47:00,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-11-30 00:47:00,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:47:00,686 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-11-30 00:47:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-11-30 00:47:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-11-30 00:47:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-30 00:47:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-11-30 00:47:00,688 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-30 00:47:00,689 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-30 00:47:00,689 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:47:00,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-11-30 00:47:00,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-11-30 00:47:00,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:47:00,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:47:00,694 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:00,695 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-11-30 00:47:00,695 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 276#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 274#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 275#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 269#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 270#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 266#L549-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 267#L549-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 268#L557-2 [2020-11-30 00:47:00,695 INFO L796 eck$LassoCheckResult]: Loop: 268#L557-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 268#L557-2 [2020-11-30 00:47:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,696 INFO L82 PathProgramCache]: Analyzing trace with hash 206358793, now seen corresponding path program 1 times [2020-11-30 00:47:00,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208760549] [2020-11-30 00:47:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:00,754 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:47:00,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208760549] [2020-11-30 00:47:00,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:00,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:47:00,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021667061] [2020-11-30 00:47:00,755 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:47:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,756 INFO L82 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2020-11-30 00:47:00,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512550770] [2020-11-30 00:47:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,762 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:00,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:00,768 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:00,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:00,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:47:00,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:00,848 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-11-30 00:47:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:00,968 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-11-30 00:47:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:47:00,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2020-11-30 00:47:00,971 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-11-30 00:47:00,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2020-11-30 00:47:00,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-30 00:47:00,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-30 00:47:00,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-11-30 00:47:00,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:47:00,973 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-11-30 00:47:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-11-30 00:47:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2020-11-30 00:47:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 00:47:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-11-30 00:47:00,976 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-11-30 00:47:00,976 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-11-30 00:47:00,976 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:47:00,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-11-30 00:47:00,977 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-11-30 00:47:00,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:47:00,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:47:00,978 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:00,978 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:47:00,979 INFO L794 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 326#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 324#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 325#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 320#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 321#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 328#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 322#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 323#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 316#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 317#L550 [2020-11-30 00:47:00,979 INFO L796 eck$LassoCheckResult]: Loop: 317#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 314#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 315#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 317#L550 [2020-11-30 00:47:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash 793653610, now seen corresponding path program 1 times [2020-11-30 00:47:00,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308415905] [2020-11-30 00:47:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:01,032 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:01,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:01,094 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:01,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:01,095 INFO L82 PathProgramCache]: Analyzing trace with hash 83461, now seen corresponding path program 2 times [2020-11-30 00:47:01,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:01,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809005665] [2020-11-30 00:47:01,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:01,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:01,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:01,122 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash -60215300, now seen corresponding path program 1 times [2020-11-30 00:47:01,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:01,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287116098] [2020-11-30 00:47:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:01,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287116098] [2020-11-30 00:47:01,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425957513] [2020-11-30 00:47:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:01,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-30 00:47:01,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:01,441 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 00:47:01,442 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:01,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:01,453 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:47:01,453 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 00:47:01,552 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:01,553 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-30 00:47:01,554 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:01,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:01,584 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 00:47:01,584 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:01,608 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:01,609 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:47:01,609 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2020-11-30 00:47:01,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:47:01,693 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 00:47:01,694 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:01,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:01,713 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:47:01,714 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:21 [2020-11-30 00:47:01,871 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-30 00:47:01,872 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2020-11-30 00:47:01,873 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:01,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:01,906 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:47:01,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:17 [2020-11-30 00:47:01,991 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:47:01,996 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:01,996 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2020-11-30 00:47:02,002 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:02,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:02,025 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:47:02,026 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:3 [2020-11-30 00:47:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:02,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:47:02,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-11-30 00:47:02,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403986676] [2020-11-30 00:47:02,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:02,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 00:47:02,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:47:02,183 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2020-11-30 00:47:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:02,828 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-11-30 00:47:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:47:02,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-11-30 00:47:02,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-11-30 00:47:02,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2020-11-30 00:47:02,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-30 00:47:02,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-30 00:47:02,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-11-30 00:47:02,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:47:02,832 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-11-30 00:47:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-11-30 00:47:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2020-11-30 00:47:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-30 00:47:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-11-30 00:47:02,836 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-30 00:47:02,836 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-30 00:47:02,836 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:47:02,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-11-30 00:47:02,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-11-30 00:47:02,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:47:02,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:47:02,838 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:02,838 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:47:02,838 INFO L794 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 433#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 431#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 432#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 426#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 427#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 435#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 428#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 429#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 437#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 436#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 430#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 422#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 423#L550 [2020-11-30 00:47:02,838 INFO L796 eck$LassoCheckResult]: Loop: 423#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 420#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 421#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 423#L550 [2020-11-30 00:47:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash -8921739, now seen corresponding path program 2 times [2020-11-30 00:47:02,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:02,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299980922] [2020-11-30 00:47:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:02,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:02,891 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:02,901 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:02,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:02,909 INFO L82 PathProgramCache]: Analyzing trace with hash 83461, now seen corresponding path program 3 times [2020-11-30 00:47:02,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:02,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790606295] [2020-11-30 00:47:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:02,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:47:02,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:47:02,933 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:47:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:02,936 INFO L82 PathProgramCache]: Analyzing trace with hash 500499473, now seen corresponding path program 2 times [2020-11-30 00:47:02,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:02,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45022133] [2020-11-30 00:47:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:03,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45022133] [2020-11-30 00:47:03,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175164575] [2020-11-30 00:47:03,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80808a17-8110-439d-bd85-c4a3544c8d2b/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:03,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:47:03,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:47:03,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 52 conjunts are in the unsatisfiable core [2020-11-30 00:47:03,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:03,300 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 00:47:03,301 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:03,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:03,315 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:47:03,315 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 00:47:03,433 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:03,433 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-30 00:47:03,435 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:03,521 INFO L625 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2020-11-30 00:47:03,529 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 00:47:03,529 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:03,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:03,558 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:47:03,559 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:37 [2020-11-30 00:47:03,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:47:03,636 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 00:47:03,637 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:03,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:03,662 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:47:03,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:34 [2020-11-30 00:47:03,776 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:03,777 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-30 00:47:03,778 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:03,802 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:03,814 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 00:47:03,815 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:03,837 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:03,839 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:47:03,839 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:42 [2020-11-30 00:47:03,975 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-30 00:47:03,975 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 26 [2020-11-30 00:47:03,977 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:04,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:04,004 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-30 00:47:04,004 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:48 [2020-11-30 00:47:04,250 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2020-11-30 00:47:04,251 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:04,305 INFO L625 ElimStorePlain]: treesize reduction 4, result has 92.3 percent of original size [2020-11-30 00:47:04,313 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 00:47:04,313 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2020-11-30 00:47:04,519 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:47:04,527 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:47:04,540 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:47:04,541 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2020-11-30 00:47:04,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:47:04,557 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:47:04,610 INFO L625 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2020-11-30 00:47:04,616 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:47:04,617 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2020-11-30 00:47:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:04,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:47:04,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-11-30 00:47:04,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486932118] [2020-11-30 00:47:04,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 00:47:04,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-11-30 00:47:04,724 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2020-11-30 00:47:18,929 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-11-30 00:47:19,237 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2020-11-30 00:47:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:19,261 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-11-30 00:47:19,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:47:19,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2020-11-30 00:47:19,263 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 00:47:19,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-11-30 00:47:19,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-30 00:47:19,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-30 00:47:19,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-30 00:47:19,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:47:19,263 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:47:19,263 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:47:19,263 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:47:19,263 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:47:19,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:47:19,264 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 00:47:19,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-30 00:47:19,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 12:47:19 BoogieIcfgContainer [2020-11-30 00:47:19,270 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 00:47:19,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:47:19,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:47:19,271 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:47:19,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:46:54" (3/4) ... [2020-11-30 00:47:19,275 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 00:47:19,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:47:19,277 INFO L168 Benchmark]: Toolchain (without parser) took 26177.05 ms. Allocated memory was 88.1 MB in the beginning and 157.3 MB in the end (delta: 69.2 MB). Free memory was 56.9 MB in the beginning and 87.4 MB in the end (delta: -30.5 MB). Peak memory consumption was 36.9 MB. Max. memory is 16.1 GB. [2020-11-30 00:47:19,278 INFO L168 Benchmark]: CDTParser took 1.06 ms. Allocated memory is still 88.1 MB. Free memory was 44.3 MB in the beginning and 44.3 MB in the end (delta: 39.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:47:19,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 860.87 ms. Allocated memory is still 88.1 MB. Free memory was 56.6 MB in the beginning and 53.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:47:19,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.71 ms. Allocated memory is still 88.1 MB. Free memory was 52.8 MB in the beginning and 51.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:47:19,279 INFO L168 Benchmark]: Boogie Preprocessor took 67.48 ms. Allocated memory is still 88.1 MB. Free memory was 51.1 MB in the beginning and 49.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:47:19,280 INFO L168 Benchmark]: RCFGBuilder took 726.87 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 49.5 MB in the beginning and 84.1 MB in the end (delta: -34.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:47:19,280 INFO L168 Benchmark]: BuchiAutomizer took 24407.86 ms. Allocated memory was 107.0 MB in the beginning and 157.3 MB in the end (delta: 50.3 MB). Free memory was 83.5 MB in the beginning and 87.4 MB in the end (delta: -3.9 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:47:19,281 INFO L168 Benchmark]: Witness Printer took 5.16 ms. Allocated memory is still 157.3 MB. Free memory is still 87.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:47:19,284 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06 ms. Allocated memory is still 88.1 MB. Free memory was 44.3 MB in the beginning and 44.3 MB in the end (delta: 39.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 860.87 ms. Allocated memory is still 88.1 MB. Free memory was 56.6 MB in the beginning and 53.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 96.71 ms. Allocated memory is still 88.1 MB. Free memory was 52.8 MB in the beginning and 51.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 67.48 ms. Allocated memory is still 88.1 MB. Free memory was 51.1 MB in the beginning and 49.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 726.87 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 49.5 MB in the beginning and 84.1 MB in the end (delta: -34.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 24407.86 ms. Allocated memory was 107.0 MB in the beginning and 157.3 MB in the end (delta: 50.3 MB). Free memory was 83.5 MB in the beginning and 87.4 MB in the end (delta: -3.9 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.16 ms. Allocated memory is still 157.3 MB. Free memory is still 87.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.3s. Construction of modules took 13.8s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 152 SDslu, 58 SDs, 0 SdLazy, 317 SolverSat, 62 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax107 hnf100 lsp88 ukn51 mio100 lsp29 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf175 smp93 tf100 neg95 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...