./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label09.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c3ab847d37615cc89461d344e344751adad439b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:17:20,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:17:20,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:17:20,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:17:20,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:17:20,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:17:20,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:17:20,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:17:20,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:17:20,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:17:20,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:17:20,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:17:20,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:17:20,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:17:20,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:17:20,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:17:20,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:17:20,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:17:20,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:17:20,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:17:20,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:17:20,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:17:20,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:17:20,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:17:20,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:17:20,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:17:20,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:17:20,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:17:20,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:17:20,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:17:20,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:17:20,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:17:20,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:17:20,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:17:20,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:17:20,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:17:20,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:17:20,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:17:20,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:17:20,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:17:20,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:17:20,090 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:17:20,105 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:17:20,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:17:20,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:17:20,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:17:20,107 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:17:20,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:17:20,108 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:17:20,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:17:20,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:17:20,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:17:20,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:17:20,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:17:20,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:17:20,109 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:17:20,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:17:20,110 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:17:20,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:17:20,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:17:20,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:17:20,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:17:20,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:17:20,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:17:20,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:17:20,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:17:20,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:17:20,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:17:20,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:17:20,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:17:20,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/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(G ! call(__VERIFIER_error())) ) 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 -> 8c3ab847d37615cc89461d344e344751adad439b [2019-11-15 21:17:20,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:17:20,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:17:20,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:17:20,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:17:20,161 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:17:20,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2019-11-15 21:17:20,224 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/data/c19b991c9/0ca2c83fd6544d19a0f82d2e8f3a001f/FLAG9fdd0bf75 [2019-11-15 21:17:20,841 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:17:20,842 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2019-11-15 21:17:20,859 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/data/c19b991c9/0ca2c83fd6544d19a0f82d2e8f3a001f/FLAG9fdd0bf75 [2019-11-15 21:17:21,098 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/data/c19b991c9/0ca2c83fd6544d19a0f82d2e8f3a001f [2019-11-15 21:17:21,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:17:21,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:17:21,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:17:21,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:17:21,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:17:21,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:21,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327f337b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21, skipping insertion in model container [2019-11-15 21:17:21,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:21,123 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:17:21,203 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:17:21,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:17:21,812 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:17:22,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:17:22,069 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:17:22,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22 WrapperNode [2019-11-15 21:17:22,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:17:22,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:17:22,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:17:22,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:17:22,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... [2019-11-15 21:17:22,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... [2019-11-15 21:17:22,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:17:22,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:17:22,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:17:22,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:17:22,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... [2019-11-15 21:17:22,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... [2019-11-15 21:17:22,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... [2019-11-15 21:17:22,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... [2019-11-15 21:17:22,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... [2019-11-15 21:17:22,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... [2019-11-15 21:17:22,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... [2019-11-15 21:17:22,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:17:22,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:17:22,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:17:22,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:17:22,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:17:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:17:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:17:24,336 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:17:24,336 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:17:24,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:17:24 BoogieIcfgContainer [2019-11-15 21:17:24,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:17:24,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:17:24,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:17:24,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:17:24,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:17:21" (1/3) ... [2019-11-15 21:17:24,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ab6e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:17:24, skipping insertion in model container [2019-11-15 21:17:24,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:22" (2/3) ... [2019-11-15 21:17:24,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ab6e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:17:24, skipping insertion in model container [2019-11-15 21:17:24,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:17:24" (3/3) ... [2019-11-15 21:17:24,351 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label09.c [2019-11-15 21:17:24,362 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:17:24,371 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:17:24,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:17:24,423 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:17:24,423 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:17:24,423 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:17:24,424 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:17:24,424 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:17:24,424 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:17:24,424 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:17:24,424 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:17:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-15 21:17:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:17:24,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:24,471 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:24,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2019-11-15 21:17:24,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:24,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337819127] [2019-11-15 21:17:24,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:24,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:24,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:17:24,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337819127] [2019-11-15 21:17:24,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:24,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:17:24,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320149991] [2019-11-15 21:17:24,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:17:24,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:24,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:17:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:17:24,882 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-15 21:17:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:27,273 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-15 21:17:27,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:17:27,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 21:17:27,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:27,300 INFO L225 Difference]: With dead ends: 850 [2019-11-15 21:17:27,300 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 21:17:27,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:17:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 21:17:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-15 21:17:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-15 21:17:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 826 transitions. [2019-11-15 21:17:27,399 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 826 transitions. Word has length 45 [2019-11-15 21:17:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:27,400 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 826 transitions. [2019-11-15 21:17:27,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:17:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 826 transitions. [2019-11-15 21:17:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 21:17:27,406 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:27,406 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:27,407 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:27,407 INFO L82 PathProgramCache]: Analyzing trace with hash 661504820, now seen corresponding path program 1 times [2019-11-15 21:17:27,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:27,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758037065] [2019-11-15 21:17:27,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:27,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:27,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:17:27,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758037065] [2019-11-15 21:17:27,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:27,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:17:27,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117587344] [2019-11-15 21:17:27,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:17:27,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:27,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:17:27,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:17:27,693 INFO L87 Difference]: Start difference. First operand 538 states and 826 transitions. Second operand 4 states. [2019-11-15 21:17:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:29,142 INFO L93 Difference]: Finished difference Result 2142 states and 3296 transitions. [2019-11-15 21:17:29,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:17:29,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-15 21:17:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:29,154 INFO L225 Difference]: With dead ends: 2142 [2019-11-15 21:17:29,154 INFO L226 Difference]: Without dead ends: 1606 [2019-11-15 21:17:29,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:17:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-15 21:17:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-15 21:17:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-15 21:17:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2029 transitions. [2019-11-15 21:17:29,226 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2029 transitions. Word has length 110 [2019-11-15 21:17:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:29,227 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2029 transitions. [2019-11-15 21:17:29,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:17:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2029 transitions. [2019-11-15 21:17:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 21:17:29,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:29,231 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:29,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:29,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1476660258, now seen corresponding path program 1 times [2019-11-15 21:17:29,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:29,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174694118] [2019-11-15 21:17:29,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:29,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:29,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:17:29,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174694118] [2019-11-15 21:17:29,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:29,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:17:29,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399919968] [2019-11-15 21:17:29,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:17:29,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:17:29,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:17:29,433 INFO L87 Difference]: Start difference. First operand 1428 states and 2029 transitions. Second operand 4 states. [2019-11-15 21:17:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:31,052 INFO L93 Difference]: Finished difference Result 4634 states and 6631 transitions. [2019-11-15 21:17:31,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:17:31,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-15 21:17:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:31,081 INFO L225 Difference]: With dead ends: 4634 [2019-11-15 21:17:31,081 INFO L226 Difference]: Without dead ends: 3208 [2019-11-15 21:17:31,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:17:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-11-15 21:17:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2674. [2019-11-15 21:17:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-15 21:17:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3515 transitions. [2019-11-15 21:17:31,179 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3515 transitions. Word has length 113 [2019-11-15 21:17:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:31,181 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3515 transitions. [2019-11-15 21:17:31,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:17:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3515 transitions. [2019-11-15 21:17:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-15 21:17:31,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:31,195 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:31,196 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 359394002, now seen corresponding path program 1 times [2019-11-15 21:17:31,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:31,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305380680] [2019-11-15 21:17:31,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:31,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:31,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 243 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-15 21:17:31,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305380680] [2019-11-15 21:17:31,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58600193] [2019-11-15 21:17:31,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:31,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:17:31,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-15 21:17:32,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:17:32,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 21:17:32,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407788771] [2019-11-15 21:17:32,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:17:32,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:17:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:17:32,115 INFO L87 Difference]: Start difference. First operand 2674 states and 3515 transitions. Second operand 4 states. [2019-11-15 21:17:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:33,356 INFO L93 Difference]: Finished difference Result 5404 states and 7116 transitions. [2019-11-15 21:17:33,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:17:33,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-11-15 21:17:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:33,374 INFO L225 Difference]: With dead ends: 5404 [2019-11-15 21:17:33,374 INFO L226 Difference]: Without dead ends: 2852 [2019-11-15 21:17:33,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:17:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-15 21:17:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2019-11-15 21:17:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-15 21:17:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3025 transitions. [2019-11-15 21:17:33,458 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3025 transitions. Word has length 302 [2019-11-15 21:17:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:33,460 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3025 transitions. [2019-11-15 21:17:33,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:17:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3025 transitions. [2019-11-15 21:17:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-11-15 21:17:33,468 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:33,469 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:33,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:33,683 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:33,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:33,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1429762887, now seen corresponding path program 1 times [2019-11-15 21:17:33,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:33,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847607993] [2019-11-15 21:17:33,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:33,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:33,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 323 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-15 21:17:34,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847607993] [2019-11-15 21:17:34,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714812850] [2019-11-15 21:17:34,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:34,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:17:34,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:34,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:17:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 304 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-15 21:17:34,978 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:17:34,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 21:17:34,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858023535] [2019-11-15 21:17:34,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:17:34,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:17:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:17:34,981 INFO L87 Difference]: Start difference. First operand 2674 states and 3025 transitions. Second operand 8 states. [2019-11-15 21:17:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:37,724 INFO L93 Difference]: Finished difference Result 5566 states and 6281 transitions. [2019-11-15 21:17:37,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:17:37,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 349 [2019-11-15 21:17:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:37,745 INFO L225 Difference]: With dead ends: 5566 [2019-11-15 21:17:37,745 INFO L226 Difference]: Without dead ends: 3072 [2019-11-15 21:17:37,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:17:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-11-15 21:17:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2674. [2019-11-15 21:17:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-15 21:17:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3020 transitions. [2019-11-15 21:17:37,824 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3020 transitions. Word has length 349 [2019-11-15 21:17:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:37,825 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3020 transitions. [2019-11-15 21:17:37,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:17:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3020 transitions. [2019-11-15 21:17:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-11-15 21:17:37,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:37,843 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:38,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:38,048 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1798273979, now seen corresponding path program 1 times [2019-11-15 21:17:38,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:38,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916622028] [2019-11-15 21:17:38,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:38,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:38,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 769 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-11-15 21:17:39,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916622028] [2019-11-15 21:17:39,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:39,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:17:39,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829056351] [2019-11-15 21:17:39,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:17:39,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:39,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:17:39,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:17:39,529 INFO L87 Difference]: Start difference. First operand 2674 states and 3020 transitions. Second operand 8 states. [2019-11-15 21:17:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:41,057 INFO L93 Difference]: Finished difference Result 5174 states and 5865 transitions. [2019-11-15 21:17:41,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:17:41,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 567 [2019-11-15 21:17:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:41,088 INFO L225 Difference]: With dead ends: 5174 [2019-11-15 21:17:41,089 INFO L226 Difference]: Without dead ends: 2680 [2019-11-15 21:17:41,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:17:41,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2019-11-15 21:17:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2674. [2019-11-15 21:17:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-15 21:17:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3012 transitions. [2019-11-15 21:17:41,162 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3012 transitions. Word has length 567 [2019-11-15 21:17:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:41,165 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3012 transitions. [2019-11-15 21:17:41,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:17:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3012 transitions. [2019-11-15 21:17:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-11-15 21:17:41,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:41,185 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:41,186 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:41,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1994977414, now seen corresponding path program 1 times [2019-11-15 21:17:41,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:41,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793196424] [2019-11-15 21:17:41,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:41,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:41,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 543 proven. 260 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-11-15 21:17:42,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793196424] [2019-11-15 21:17:42,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216162466] [2019-11-15 21:17:42,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:42,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:17:42,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-11-15 21:17:42,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:17:42,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 21:17:42,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578377250] [2019-11-15 21:17:42,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:17:42,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:42,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:17:42,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:17:42,966 INFO L87 Difference]: Start difference. First operand 2674 states and 3012 transitions. Second operand 4 states. [2019-11-15 21:17:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:43,616 INFO L93 Difference]: Finished difference Result 6770 states and 7740 transitions. [2019-11-15 21:17:43,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:17:43,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 593 [2019-11-15 21:17:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:43,634 INFO L225 Difference]: With dead ends: 6770 [2019-11-15 21:17:43,634 INFO L226 Difference]: Without dead ends: 4276 [2019-11-15 21:17:43,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 592 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:17:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-15 21:17:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2019-11-15 21:17:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-11-15 21:17:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4670 transitions. [2019-11-15 21:17:43,710 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4670 transitions. Word has length 593 [2019-11-15 21:17:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:43,711 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4670 transitions. [2019-11-15 21:17:43,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:17:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4670 transitions. [2019-11-15 21:17:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-11-15 21:17:43,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:43,718 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:43,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:43,929 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1713531829, now seen corresponding path program 1 times [2019-11-15 21:17:43,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:43,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54405109] [2019-11-15 21:17:43,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:43,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:43,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 21:17:44,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54405109] [2019-11-15 21:17:44,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737180069] [2019-11-15 21:17:44,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:44,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:17:44,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 21:17:45,004 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:17:45,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-15 21:17:45,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783514594] [2019-11-15 21:17:45,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:17:45,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:45,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:17:45,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:17:45,008 INFO L87 Difference]: Start difference. First operand 4276 states and 4670 transitions. Second operand 5 states. [2019-11-15 21:17:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:46,446 INFO L93 Difference]: Finished difference Result 10688 states and 11721 transitions. [2019-11-15 21:17:46,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:17:46,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 634 [2019-11-15 21:17:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:46,466 INFO L225 Difference]: With dead ends: 10688 [2019-11-15 21:17:46,466 INFO L226 Difference]: Without dead ends: 6592 [2019-11-15 21:17:46,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:17:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2019-11-15 21:17:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 5344. [2019-11-15 21:17:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-15 21:17:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5832 transitions. [2019-11-15 21:17:46,563 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5832 transitions. Word has length 634 [2019-11-15 21:17:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:46,564 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5832 transitions. [2019-11-15 21:17:46,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:17:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5832 transitions. [2019-11-15 21:17:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2019-11-15 21:17:46,570 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:46,571 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:46,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:46,774 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:46,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:46,775 INFO L82 PathProgramCache]: Analyzing trace with hash 223844596, now seen corresponding path program 1 times [2019-11-15 21:17:46,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:46,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590936285] [2019-11-15 21:17:46,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:46,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:46,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1060 proven. 260 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-15 21:17:47,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590936285] [2019-11-15 21:17:47,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706774935] [2019-11-15 21:17:47,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:47,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:17:47,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1111 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-11-15 21:17:48,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:17:48,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-15 21:17:48,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453091499] [2019-11-15 21:17:48,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:17:48,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:48,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:17:48,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:17:48,408 INFO L87 Difference]: Start difference. First operand 5344 states and 5832 transitions. Second operand 3 states. [2019-11-15 21:17:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:48,915 INFO L93 Difference]: Finished difference Result 11220 states and 12246 transitions. [2019-11-15 21:17:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:17:48,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 644 [2019-11-15 21:17:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:48,938 INFO L225 Difference]: With dead ends: 11220 [2019-11-15 21:17:48,938 INFO L226 Difference]: Without dead ends: 6056 [2019-11-15 21:17:48,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:17:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-11-15 21:17:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5700. [2019-11-15 21:17:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-11-15 21:17:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6183 transitions. [2019-11-15 21:17:49,020 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6183 transitions. Word has length 644 [2019-11-15 21:17:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:49,021 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6183 transitions. [2019-11-15 21:17:49,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:17:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6183 transitions. [2019-11-15 21:17:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2019-11-15 21:17:49,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:49,028 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:49,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:49,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1244517444, now seen corresponding path program 1 times [2019-11-15 21:17:49,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:49,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578232273] [2019-11-15 21:17:49,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:49,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:49,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 1036 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-11-15 21:17:49,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578232273] [2019-11-15 21:17:49,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:49,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:17:49,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446206034] [2019-11-15 21:17:49,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:17:49,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:49,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:17:49,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:17:49,918 INFO L87 Difference]: Start difference. First operand 5700 states and 6183 transitions. Second operand 4 states. [2019-11-15 21:17:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:50,844 INFO L93 Difference]: Finished difference Result 11932 states and 12993 transitions. [2019-11-15 21:17:50,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:17:50,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 751 [2019-11-15 21:17:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:50,856 INFO L225 Difference]: With dead ends: 11932 [2019-11-15 21:17:50,856 INFO L226 Difference]: Without dead ends: 6412 [2019-11-15 21:17:50,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:17:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-15 21:17:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5344. [2019-11-15 21:17:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-15 21:17:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5717 transitions. [2019-11-15 21:17:50,928 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5717 transitions. Word has length 751 [2019-11-15 21:17:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:50,930 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5717 transitions. [2019-11-15 21:17:50,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:17:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5717 transitions. [2019-11-15 21:17:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2019-11-15 21:17:50,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:50,939 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:50,939 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1327784350, now seen corresponding path program 1 times [2019-11-15 21:17:50,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:50,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292309099] [2019-11-15 21:17:50,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:50,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:50,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1166 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-15 21:17:51,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292309099] [2019-11-15 21:17:51,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655412880] [2019-11-15 21:17:51,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:17:51,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:51,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:17:51,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:17:51,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:17:51,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:17:52,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:17:52,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:17:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1302 proven. 489 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-11-15 21:17:52,852 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:17:52,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-15 21:17:52,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363983633] [2019-11-15 21:17:52,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:17:52,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:17:52,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:17:52,855 INFO L87 Difference]: Start difference. First operand 5344 states and 5717 transitions. Second operand 8 states. [2019-11-15 21:17:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:56,085 INFO L93 Difference]: Finished difference Result 13180 states and 14130 transitions. [2019-11-15 21:17:56,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:17:56,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 801 [2019-11-15 21:17:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:56,100 INFO L225 Difference]: With dead ends: 13180 [2019-11-15 21:17:56,100 INFO L226 Difference]: Without dead ends: 8016 [2019-11-15 21:17:56,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 801 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:17:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8016 states. [2019-11-15 21:17:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8016 to 7302. [2019-11-15 21:17:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-11-15 21:17:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 7758 transitions. [2019-11-15 21:17:56,201 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 7758 transitions. Word has length 801 [2019-11-15 21:17:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:56,203 INFO L462 AbstractCegarLoop]: Abstraction has 7302 states and 7758 transitions. [2019-11-15 21:17:56,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:17:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 7758 transitions. [2019-11-15 21:17:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-11-15 21:17:56,210 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:56,211 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:56,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:56,423 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash 776024818, now seen corresponding path program 1 times [2019-11-15 21:17:56,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:56,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606635676] [2019-11-15 21:17:56,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:56,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:56,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 563 proven. 234 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-11-15 21:17:57,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606635676] [2019-11-15 21:17:57,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411564500] [2019-11-15 21:17:57,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:57,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:17:57,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-11-15 21:17:58,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:17:58,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-15 21:17:58,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441292220] [2019-11-15 21:17:58,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:17:58,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:17:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:17:58,136 INFO L87 Difference]: Start difference. First operand 7302 states and 7758 transitions. Second operand 3 states. [2019-11-15 21:17:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:58,840 INFO L93 Difference]: Finished difference Result 14780 states and 15738 transitions. [2019-11-15 21:17:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:17:58,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 803 [2019-11-15 21:17:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:58,853 INFO L225 Difference]: With dead ends: 14780 [2019-11-15 21:17:58,853 INFO L226 Difference]: Without dead ends: 7658 [2019-11-15 21:17:58,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 804 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:17:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2019-11-15 21:17:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 6946. [2019-11-15 21:17:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6946 states. [2019-11-15 21:17:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6946 states to 6946 states and 7369 transitions. [2019-11-15 21:17:59,056 INFO L78 Accepts]: Start accepts. Automaton has 6946 states and 7369 transitions. Word has length 803 [2019-11-15 21:17:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:59,057 INFO L462 AbstractCegarLoop]: Abstraction has 6946 states and 7369 transitions. [2019-11-15 21:17:59,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:17:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6946 states and 7369 transitions. [2019-11-15 21:17:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2019-11-15 21:17:59,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:59,068 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:59,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:59,272 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:17:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1446623235, now seen corresponding path program 1 times [2019-11-15 21:17:59,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:59,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157533419] [2019-11-15 21:17:59,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:59,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:59,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 219 proven. 1018 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-11-15 21:18:00,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157533419] [2019-11-15 21:18:00,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105813784] [2019-11-15 21:18:00,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:01,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 21:18:01,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:01,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:01,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:02,663 WARN L191 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 29 [2019-11-15 21:18:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:02,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:02,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:02,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:02,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:02,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:02,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 629 proven. 720 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-11-15 21:18:04,843 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:04,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-15 21:18:04,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014103186] [2019-11-15 21:18:04,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:18:04,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:04,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:18:04,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:18:04,846 INFO L87 Difference]: Start difference. First operand 6946 states and 7369 transitions. Second operand 16 states. [2019-11-15 21:18:06,080 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 21:18:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:49,482 INFO L93 Difference]: Finished difference Result 17510 states and 18624 transitions. [2019-11-15 21:18:49,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 21:18:49,482 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 920 [2019-11-15 21:18:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:49,498 INFO L225 Difference]: With dead ends: 17510 [2019-11-15 21:18:49,498 INFO L226 Difference]: Without dead ends: 10744 [2019-11-15 21:18:49,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 945 GetRequests, 915 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-11-15 21:18:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10744 states. [2019-11-15 21:18:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10744 to 7658. [2019-11-15 21:18:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7658 states. [2019-11-15 21:18:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 8173 transitions. [2019-11-15 21:18:49,613 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 8173 transitions. Word has length 920 [2019-11-15 21:18:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:49,614 INFO L462 AbstractCegarLoop]: Abstraction has 7658 states and 8173 transitions. [2019-11-15 21:18:49,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:18:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 8173 transitions. [2019-11-15 21:18:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2019-11-15 21:18:49,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:49,629 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:49,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:49,836 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:18:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1474396649, now seen corresponding path program 1 times [2019-11-15 21:18:49,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:49,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022394872] [2019-11-15 21:18:49,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:49,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:49,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3724 backedges. 1134 proven. 0 refuted. 0 times theorem prover too weak. 2590 trivial. 0 not checked. [2019-11-15 21:18:50,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022394872] [2019-11-15 21:18:50,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:50,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:18:50,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357828706] [2019-11-15 21:18:50,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:18:50,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:50,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:18:50,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:18:50,990 INFO L87 Difference]: Start difference. First operand 7658 states and 8173 transitions. Second operand 6 states. [2019-11-15 21:18:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:51,599 INFO L93 Difference]: Finished difference Result 15180 states and 16196 transitions. [2019-11-15 21:18:51,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:18:51,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1027 [2019-11-15 21:18:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:51,610 INFO L225 Difference]: With dead ends: 15180 [2019-11-15 21:18:51,610 INFO L226 Difference]: Without dead ends: 7480 [2019-11-15 21:18:51,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:18:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7480 states. [2019-11-15 21:18:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7480 to 7302. [2019-11-15 21:18:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-11-15 21:18:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 7791 transitions. [2019-11-15 21:18:51,701 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 7791 transitions. Word has length 1027 [2019-11-15 21:18:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:51,702 INFO L462 AbstractCegarLoop]: Abstraction has 7302 states and 7791 transitions. [2019-11-15 21:18:51,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:18:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 7791 transitions. [2019-11-15 21:18:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1050 [2019-11-15 21:18:51,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:51,717 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:51,717 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:18:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:51,717 INFO L82 PathProgramCache]: Analyzing trace with hash 959953204, now seen corresponding path program 1 times [2019-11-15 21:18:51,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:51,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897891993] [2019-11-15 21:18:51,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:51,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:51,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3286 backedges. 27 proven. 798 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-11-15 21:18:53,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897891993] [2019-11-15 21:18:53,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509951883] [2019-11-15 21:18:53,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/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 [2019-11-15 21:18:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:53,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:18:53,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:53,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:53,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3286 backedges. 482 proven. 343 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-11-15 21:18:54,665 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:54,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-11-15 21:18:54,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247623642] [2019-11-15 21:18:54,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:18:54,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:54,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:18:54,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:18:54,667 INFO L87 Difference]: Start difference. First operand 7302 states and 7791 transitions. Second operand 11 states. [2019-11-15 21:18:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:59,396 INFO L93 Difference]: Finished difference Result 18518 states and 19757 transitions. [2019-11-15 21:18:59,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 21:18:59,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1049 [2019-11-15 21:18:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:59,406 INFO L225 Difference]: With dead ends: 18518 [2019-11-15 21:18:59,406 INFO L226 Difference]: Without dead ends: 10684 [2019-11-15 21:18:59,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 1047 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2019-11-15 21:18:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10684 states. [2019-11-15 21:18:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10684 to 8014. [2019-11-15 21:18:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8014 states. [2019-11-15 21:18:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8014 states to 8014 states and 8439 transitions. [2019-11-15 21:18:59,562 INFO L78 Accepts]: Start accepts. Automaton has 8014 states and 8439 transitions. Word has length 1049 [2019-11-15 21:18:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:59,562 INFO L462 AbstractCegarLoop]: Abstraction has 8014 states and 8439 transitions. [2019-11-15 21:18:59,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:18:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 8014 states and 8439 transitions. [2019-11-15 21:18:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2101 [2019-11-15 21:18:59,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:59,592 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:59,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:59,796 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:18:59,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash -175255361, now seen corresponding path program 1 times [2019-11-15 21:18:59,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:59,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044324387] [2019-11-15 21:18:59,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:59,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:59,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14291 backedges. 3047 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-11-15 21:19:02,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044324387] [2019-11-15 21:19:02,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:02,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:19:02,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513159436] [2019-11-15 21:19:02,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:19:02,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:02,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:19:02,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:19:02,893 INFO L87 Difference]: Start difference. First operand 8014 states and 8439 transitions. Second operand 7 states. [2019-11-15 21:19:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:03,691 INFO L93 Difference]: Finished difference Result 15858 states and 16680 transitions. [2019-11-15 21:19:03,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:19:03,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2100 [2019-11-15 21:19:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:03,697 INFO L225 Difference]: With dead ends: 15858 [2019-11-15 21:19:03,697 INFO L226 Difference]: Without dead ends: 7658 [2019-11-15 21:19:03,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:19:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2019-11-15 21:19:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 7658. [2019-11-15 21:19:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7658 states. [2019-11-15 21:19:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 8035 transitions. [2019-11-15 21:19:03,772 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 8035 transitions. Word has length 2100 [2019-11-15 21:19:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:03,773 INFO L462 AbstractCegarLoop]: Abstraction has 7658 states and 8035 transitions. [2019-11-15 21:19:03,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:19:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 8035 transitions. [2019-11-15 21:19:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2135 [2019-11-15 21:19:03,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:03,810 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:03,810 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1967952804, now seen corresponding path program 1 times [2019-11-15 21:19:03,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:03,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396147795] [2019-11-15 21:19:03,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:03,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:03,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14738 backedges. 3419 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2019-11-15 21:19:06,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396147795] [2019-11-15 21:19:06,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:06,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:06,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143987876] [2019-11-15 21:19:06,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:06,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:06,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:06,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:06,838 INFO L87 Difference]: Start difference. First operand 7658 states and 8035 transitions. Second operand 4 states. [2019-11-15 21:19:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:07,444 INFO L93 Difference]: Finished difference Result 16204 states and 16946 transitions. [2019-11-15 21:19:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:07,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2134 [2019-11-15 21:19:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:07,449 INFO L225 Difference]: With dead ends: 16204 [2019-11-15 21:19:07,449 INFO L226 Difference]: Without dead ends: 5344 [2019-11-15 21:19:07,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-11-15 21:19:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2019-11-15 21:19:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-15 21:19:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5453 transitions. [2019-11-15 21:19:07,506 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5453 transitions. Word has length 2134 [2019-11-15 21:19:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:07,508 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5453 transitions. [2019-11-15 21:19:07,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5453 transitions. [2019-11-15 21:19:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2195 [2019-11-15 21:19:07,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:07,542 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:07,543 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1002385036, now seen corresponding path program 1 times [2019-11-15 21:19:07,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:07,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091568447] [2019-11-15 21:19:07,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:07,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:07,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14978 backedges. 3696 proven. 38 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-11-15 21:19:11,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091568447] [2019-11-15 21:19:11,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334193783] [2019-11-15 21:19:11,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/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 [2019-11-15 21:19:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:12,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:19:12,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14978 backedges. 3668 proven. 66 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-11-15 21:19:15,285 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:19:15,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-15 21:19:15,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424423363] [2019-11-15 21:19:15,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:19:15,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:15,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:19:15,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:19:15,289 INFO L87 Difference]: Start difference. First operand 5344 states and 5453 transitions. Second operand 12 states. [2019-11-15 21:19:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:18,156 INFO L93 Difference]: Finished difference Result 10143 states and 10359 transitions. [2019-11-15 21:19:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:19:18,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 2194 [2019-11-15 21:19:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:18,158 INFO L225 Difference]: With dead ends: 10143 [2019-11-15 21:19:18,158 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:19:18,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2215 GetRequests, 2198 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:19:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:19:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:19:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:19:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:19:18,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2194 [2019-11-15 21:19:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:18,162 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:19:18,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:19:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:19:18,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:19:18,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:18,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:19:18,784 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 409 DAG size of output: 288 [2019-11-15 21:19:19,165 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 409 DAG size of output: 288 [2019-11-15 21:19:21,537 WARN L191 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 266 DAG size of output: 104 [2019-11-15 21:19:23,795 WARN L191 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 266 DAG size of output: 104 [2019-11-15 21:19:23,797 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-15 21:19:23,797 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-15 21:19:23,797 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,797 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-15 21:19:23,798 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 21:19:23,799 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,800 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 21:19:23,801 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,802 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 21:19:23,803 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-15 21:19:23,804 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 21:19:23,805 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-15 21:19:23,806 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,807 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse15 (= 8 ~a21~0)) (.cse0 (= ~a24~0 1)) (.cse4 (not (= 5 ~a15~0)))) (let ((.cse6 (not (= 6 ~a21~0))) (.cse11 (and .cse15 .cse0 .cse4)) (.cse7 (<= (+ ~a12~0 60121) 0)) (.cse10 (= ~a21~0 7)) (.cse16 (< 80 ~a12~0)) (.cse18 (<= (+ ~a12~0 45156) 0)) (.cse19 (not (= 10 ~a21~0))) (.cse12 (<= ~a12~0 225871)) (.cse14 (<= ~a12~0 75)) (.cse3 (<= ~a15~0 8)) (.cse17 (<= ~a21~0 6)) (.cse2 (not (= ~a15~0 8))) (.cse21 (= 8 ~a15~0)) (.cse1 (exists ((v_~a12~0_443 Int)) (and (<= ~a12~0 (+ (mod v_~a12~0_443 299959) 300039)) (<= 0 v_~a12~0_443) (< 80 v_~a12~0_443)))) (.cse8 (= ~a21~0 10)) (.cse9 (= ~a15~0 9)) (.cse13 (<= ~a12~0 11)) (.cse5 (< 0 (+ ~a12~0 43)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9) (and (and (and (<= ~a12~0 80) (not .cse10) .cse6) .cse5) .cse0 .cse3) (and .cse11 .cse2 .cse3) (and (and .cse12 .cse11 .cse5) .cse3) (and .cse0 .cse13 .cse3 .cse5) (and .cse14 .cse15 .cse0 .cse9 .cse5) (and .cse0 .cse9 .cse16) (and .cse17 .cse18 .cse2 .cse3) (and .cse7 .cse15 .cse0 .cse9) (and .cse19 .cse0 .cse2 .cse13 .cse3 .cse4) (and .cse0 .cse10 .cse2 .cse3) (let ((.cse20 (= ~a21~0 6))) (or (and .cse0 (and .cse20 .cse16) .cse3 .cse4) (and (or (not .cse20) .cse16) .cse0 .cse1 (or .cse20 .cse13) .cse3 .cse17))) (or (and .cse18 .cse0 .cse3 .cse4) (and (and .cse19 (<= (+ ~a12~0 49) 0)) .cse0 .cse3)) (and .cse0 .cse8 .cse3 (<= ~a12~0 73281) .cse5) (and (and .cse12 (or (and .cse14 (and .cse0 .cse4) .cse5 .cse17) (and .cse21 .cse0 .cse5 .cse17))) .cse3) (and (= ~a15~0 7) .cse0 .cse8) (and (and .cse0 .cse13 .cse3 .cse17) .cse2) (and .cse21 .cse0 .cse8 .cse1) (and .cse0 .cse8 .cse9 .cse13 .cse5)))) [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 21:19:23,808 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,809 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse15 (= 8 ~a21~0)) (.cse0 (= ~a24~0 1)) (.cse4 (not (= 5 ~a15~0)))) (let ((.cse6 (not (= 6 ~a21~0))) (.cse11 (and .cse15 .cse0 .cse4)) (.cse7 (<= (+ ~a12~0 60121) 0)) (.cse10 (= ~a21~0 7)) (.cse16 (< 80 ~a12~0)) (.cse18 (<= (+ ~a12~0 45156) 0)) (.cse19 (not (= 10 ~a21~0))) (.cse12 (<= ~a12~0 225871)) (.cse14 (<= ~a12~0 75)) (.cse3 (<= ~a15~0 8)) (.cse17 (<= ~a21~0 6)) (.cse2 (not (= ~a15~0 8))) (.cse21 (= 8 ~a15~0)) (.cse1 (exists ((v_~a12~0_443 Int)) (and (<= ~a12~0 (+ (mod v_~a12~0_443 299959) 300039)) (<= 0 v_~a12~0_443) (< 80 v_~a12~0_443)))) (.cse8 (= ~a21~0 10)) (.cse9 (= ~a15~0 9)) (.cse13 (<= ~a12~0 11)) (.cse5 (< 0 (+ ~a12~0 43)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9) (and (and (and (<= ~a12~0 80) (not .cse10) .cse6) .cse5) .cse0 .cse3) (and .cse11 .cse2 .cse3) (and (and .cse12 .cse11 .cse5) .cse3) (and .cse0 .cse13 .cse3 .cse5) (and .cse14 .cse15 .cse0 .cse9 .cse5) (and .cse0 .cse9 .cse16) (and .cse17 .cse18 .cse2 .cse3) (and .cse7 .cse15 .cse0 .cse9) (and .cse19 .cse0 .cse2 .cse13 .cse3 .cse4) (and .cse0 .cse10 .cse2 .cse3) (let ((.cse20 (= ~a21~0 6))) (or (and .cse0 (and .cse20 .cse16) .cse3 .cse4) (and (or (not .cse20) .cse16) .cse0 .cse1 (or .cse20 .cse13) .cse3 .cse17))) (or (and .cse18 .cse0 .cse3 .cse4) (and (and .cse19 (<= (+ ~a12~0 49) 0)) .cse0 .cse3)) (and .cse0 .cse8 .cse3 (<= ~a12~0 73281) .cse5) (and (and .cse12 (or (and .cse14 (and .cse0 .cse4) .cse5 .cse17) (and .cse21 .cse0 .cse5 .cse17))) .cse3) (and (= ~a15~0 7) .cse0 .cse8) (and (and .cse0 .cse13 .cse3 .cse17) .cse2) (and .cse21 .cse0 .cse8 .cse1) (and .cse0 .cse8 .cse9 .cse13 .cse5)))) [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,810 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,811 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-15 21:19:23,811 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 21:19:23,811 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 21:19:23,811 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 21:19:23,811 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-15 21:19:23,811 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-15 21:19:23,811 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-15 21:19:23,811 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-15 21:19:23,811 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-15 21:19:23,815 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,815 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,816 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,816 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-15 21:19:23,816 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-15 21:19:23,816 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 21:19:23,816 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 21:19:23,816 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:19:23,816 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 21:19:23,817 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-15 21:19:23,817 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-15 21:19:23,817 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-15 21:19:23,817 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-11-15 21:19:23,817 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,817 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,817 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,818 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-15 21:19:23,818 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 21:19:23,818 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 21:19:23,818 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 21:19:23,818 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-15 21:19:23,818 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-15 21:19:23,818 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-15 21:19:23,818 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-15 21:19:23,819 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-15 21:19:23,819 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,819 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,819 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:19:23,819 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-15 21:19:23,819 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 21:19:23,819 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 21:19:23,820 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 21:19:23,820 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-15 21:19:23,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:23,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:19:23 BoogieIcfgContainer [2019-11-15 21:19:23,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:19:23,873 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:19:23,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:19:23,873 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:19:23,874 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:17:24" (3/4) ... [2019-11-15 21:19:23,877 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:19:23,899 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:19:23,901 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:19:23,927 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a24 == 1 && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) && !(6 == a21)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a12 <= 80 && !(a21 == 7)) && !(6 == a21)) && 0 < a12 + 43) && a24 == 1) && a15 <= 8)) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((a12 <= 225871 && (8 == a21 && a24 == 1) && !(5 == a15)) && 0 < a12 + 43) && a15 <= 8)) || (((a24 == 1 && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || ((((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9) && 0 < a12 + 43)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a21 <= 6 && a12 + 45156 <= 0) && !(a15 == 8)) && a15 <= 8)) || (((a12 + 60121 <= 0 && 8 == a21) && a24 == 1) && a15 == 9)) || (((((!(10 == a21) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && !(5 == a15))) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 6 && 80 < a12) && a15 <= 8) && !(5 == a15)) || ((((((!(a21 == 6) || 80 < a12) && a24 == 1) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && (a21 == 6 || a12 <= 11)) && a15 <= 8) && a21 <= 6)) || (((a12 + 45156 <= 0 && a24 == 1) && a15 <= 8) && !(5 == a15)) || (((!(10 == a21) && a12 + 49 <= 0) && a24 == 1) && a15 <= 8)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || ((a12 <= 225871 && ((((a12 <= 75 && a24 == 1 && !(5 == a15)) && 0 < a12 + 43) && a21 <= 6) || (((8 == a15 && a24 == 1) && 0 < a12 + 43) && a21 <= 6))) && a15 <= 8)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || ((((a24 == 1 && a12 <= 11) && a15 <= 8) && a21 <= 6) && !(a15 == 8))) || (((8 == a15 && a24 == 1) && a21 == 10) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443))) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) && 0 < a12 + 43) [2019-11-15 21:19:23,930 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a24 == 1 && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) && !(6 == a21)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a12 <= 80 && !(a21 == 7)) && !(6 == a21)) && 0 < a12 + 43) && a24 == 1) && a15 <= 8)) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((a12 <= 225871 && (8 == a21 && a24 == 1) && !(5 == a15)) && 0 < a12 + 43) && a15 <= 8)) || (((a24 == 1 && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || ((((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9) && 0 < a12 + 43)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a21 <= 6 && a12 + 45156 <= 0) && !(a15 == 8)) && a15 <= 8)) || (((a12 + 60121 <= 0 && 8 == a21) && a24 == 1) && a15 == 9)) || (((((!(10 == a21) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && !(5 == a15))) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 6 && 80 < a12) && a15 <= 8) && !(5 == a15)) || ((((((!(a21 == 6) || 80 < a12) && a24 == 1) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && (a21 == 6 || a12 <= 11)) && a15 <= 8) && a21 <= 6)) || (((a12 + 45156 <= 0 && a24 == 1) && a15 <= 8) && !(5 == a15)) || (((!(10 == a21) && a12 + 49 <= 0) && a24 == 1) && a15 <= 8)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || ((a12 <= 225871 && ((((a12 <= 75 && a24 == 1 && !(5 == a15)) && 0 < a12 + 43) && a21 <= 6) || (((8 == a15 && a24 == 1) && 0 < a12 + 43) && a21 <= 6))) && a15 <= 8)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || ((((a24 == 1 && a12 <= 11) && a15 <= 8) && a21 <= 6) && !(a15 == 8))) || (((8 == a15 && a24 == 1) && a21 == 10) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443))) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) && 0 < a12 + 43) [2019-11-15 21:19:24,051 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b5fe6d64-a249-4b58-b4e3-93e9c9a69033/bin/uautomizer/witness.graphml [2019-11-15 21:19:24,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:19:24,052 INFO L168 Benchmark]: Toolchain (without parser) took 122950.84 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -236.9 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-11-15 21:19:24,053 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:19:24,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 965.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:24,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:24,054 INFO L168 Benchmark]: Boogie Preprocessor took 109.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:24,054 INFO L168 Benchmark]: RCFGBuilder took 2017.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.7 MB in the end (delta: 128.5 MB). Peak memory consumption was 128.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:24,054 INFO L168 Benchmark]: TraceAbstraction took 119533.42 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 980.7 MB in the beginning and 1.3 GB in the end (delta: -305.6 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-11-15 21:19:24,055 INFO L168 Benchmark]: Witness Printer took 178.02 ms. Allocated memory is still 5.1 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 110.1 MB). Peak memory consumption was 110.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:24,056 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 965.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2017.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.7 MB in the end (delta: 128.5 MB). Peak memory consumption was 128.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119533.42 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 980.7 MB in the beginning and 1.3 GB in the end (delta: -305.6 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 178.02 ms. Allocated memory is still 5.1 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 110.1 MB). Peak memory consumption was 110.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2019-11-15 21:19:24,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a24 == 1 && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) && !(6 == a21)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a12 <= 80 && !(a21 == 7)) && !(6 == a21)) && 0 < a12 + 43) && a24 == 1) && a15 <= 8)) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((a12 <= 225871 && (8 == a21 && a24 == 1) && !(5 == a15)) && 0 < a12 + 43) && a15 <= 8)) || (((a24 == 1 && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || ((((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9) && 0 < a12 + 43)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a21 <= 6 && a12 + 45156 <= 0) && !(a15 == 8)) && a15 <= 8)) || (((a12 + 60121 <= 0 && 8 == a21) && a24 == 1) && a15 == 9)) || (((((!(10 == a21) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && !(5 == a15))) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 6 && 80 < a12) && a15 <= 8) && !(5 == a15)) || ((((((!(a21 == 6) || 80 < a12) && a24 == 1) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && (a21 == 6 || a12 <= 11)) && a15 <= 8) && a21 <= 6)) || (((a12 + 45156 <= 0 && a24 == 1) && a15 <= 8) && !(5 == a15)) || (((!(10 == a21) && a12 + 49 <= 0) && a24 == 1) && a15 <= 8)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || ((a12 <= 225871 && ((((a12 <= 75 && a24 == 1 && !(5 == a15)) && 0 < a12 + 43) && a21 <= 6) || (((8 == a15 && a24 == 1) && 0 < a12 + 43) && a21 <= 6))) && a15 <= 8)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || ((((a24 == 1 && a12 <= 11) && a15 <= 8) && a21 <= 6) && !(a15 == 8))) || (((8 == a15 && a24 == 1) && a21 == 10) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443))) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) && 0 < a12 + 43) - InvariantResult [Line: 20]: Loop Invariant [2019-11-15 21:19:24,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-11-15 21:19:24,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a24 == 1 && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) && !(6 == a21)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a12 <= 80 && !(a21 == 7)) && !(6 == a21)) && 0 < a12 + 43) && a24 == 1) && a15 <= 8)) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((a12 <= 225871 && (8 == a21 && a24 == 1) && !(5 == a15)) && 0 < a12 + 43) && a15 <= 8)) || (((a24 == 1 && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || ((((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9) && 0 < a12 + 43)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a21 <= 6 && a12 + 45156 <= 0) && !(a15 == 8)) && a15 <= 8)) || (((a12 + 60121 <= 0 && 8 == a21) && a24 == 1) && a15 == 9)) || (((((!(10 == a21) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && !(5 == a15))) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 6 && 80 < a12) && a15 <= 8) && !(5 == a15)) || ((((((!(a21 == 6) || 80 < a12) && a24 == 1) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && (a21 == 6 || a12 <= 11)) && a15 <= 8) && a21 <= 6)) || (((a12 + 45156 <= 0 && a24 == 1) && a15 <= 8) && !(5 == a15)) || (((!(10 == a21) && a12 + 49 <= 0) && a24 == 1) && a15 <= 8)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || ((a12 <= 225871 && ((((a12 <= 75 && a24 == 1 && !(5 == a15)) && 0 < a12 + 43) && a21 <= 6) || (((8 == a15 && a24 == 1) && 0 < a12 + 43) && a21 <= 6))) && a15 <= 8)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || ((((a24 == 1 && a12 <= 11) && a15 <= 8) && a21 <= 6) && !(a15 == 8))) || (((8 == a15 && a24 == 1) && a21 == 10) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443))) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) && 0 < a12 + 43) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 119.4s, OverallIterations: 18, TraceHistogramMax: 18, AutomataDifference: 73.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, HoareTripleCheckerStatistics: 1397 SDtfs, 15937 SDslu, 412 SDs, 0 SdLazy, 28526 SolverSat, 3049 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 64.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8455 GetRequests, 8297 SyntacticMatches, 11 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8014occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 11326 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 130 NumberOfFragments, 919 HoareAnnotationTreeSize, 3 FomulaSimplifications, 87226 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 29292 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 23425 NumberOfCodeBlocks, 23425 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 23397 ConstructedInterpolants, 181 QuantifiedInterpolants, 80732711 SizeOfPredicates, 17 NumberOfNonLiveVariables, 10177 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 90106/94655 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...