./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label46.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_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label46.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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 15c406f4c881927013bc1c3740a0ccf2226e847a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:07:06,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:07:06,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:07:06,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:07:06,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:07:06,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:07:06,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:07:06,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:07:06,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:07:06,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:07:06,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:07:06,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:07:06,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:07:06,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:07:06,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:07:06,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:07:06,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:07:06,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:07:06,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:07:06,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:07:06,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:07:06,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:07:06,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:07:06,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:07:06,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:07:06,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:07:06,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:07:06,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:07:06,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:07:06,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:07:06,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:07:06,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:07:06,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:07:06,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:07:06,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:07:06,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:07:06,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:07:06,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:07:06,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:07:06,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:07:06,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:07:06,467 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:07:06,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:07:06,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:07:06,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:07:06,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:07:06,513 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:07:06,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:07:06,514 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:07:06,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:07:06,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:07:06,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:07:06,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:07:06,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:07:06,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:07:06,518 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:07:06,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:07:06,518 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:07:06,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:07:06,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:07:06,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:07:06,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:07:06,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:07:06,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:07:06,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:07:06,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:07:06,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:07:06,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:07:06,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:07:06,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:07:06,523 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_2c07f53c-cd81-4528-9390-5a5e0ee922da/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 -> 15c406f4c881927013bc1c3740a0ccf2226e847a [2019-11-16 00:07:06,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:07:06,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:07:06,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:07:06,588 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:07:06,588 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:07:06,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label46.c [2019-11-16 00:07:06,660 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/data/1c1bce32b/d6909bf59dab4578a66c4a47f6f1b523/FLAG308a549a8 [2019-11-16 00:07:07,272 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:07:07,273 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/sv-benchmarks/c/eca-rers2012/Problem14_label46.c [2019-11-16 00:07:07,288 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/data/1c1bce32b/d6909bf59dab4578a66c4a47f6f1b523/FLAG308a549a8 [2019-11-16 00:07:07,493 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/data/1c1bce32b/d6909bf59dab4578a66c4a47f6f1b523 [2019-11-16 00:07:07,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:07:07,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:07:07,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:07:07,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:07:07,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:07:07,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:07" (1/1) ... [2019-11-16 00:07:07,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277b8c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:07, skipping insertion in model container [2019-11-16 00:07:07,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:07" (1/1) ... [2019-11-16 00:07:07,517 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:07:07,574 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:07:08,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:07:08,152 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:07:08,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:07:08,361 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:07:08,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08 WrapperNode [2019-11-16 00:07:08,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:07:08,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:07:08,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:07:08,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:07:08,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... [2019-11-16 00:07:08,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... [2019-11-16 00:07:08,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:07:08,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:07:08,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:07:08,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:07:08,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... [2019-11-16 00:07:08,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... [2019-11-16 00:07:08,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... [2019-11-16 00:07:08,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... [2019-11-16 00:07:08,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... [2019-11-16 00:07:08,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... [2019-11-16 00:07:08,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... [2019-11-16 00:07:08,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:07:08,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:07:08,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:07:08,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:07:08,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:07:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:07:10,558 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:07:10,559 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:07:10,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:10 BoogieIcfgContainer [2019-11-16 00:07:10,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:07:10,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:07:10,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:07:10,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:07:10,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:07:07" (1/3) ... [2019-11-16 00:07:10,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e851afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:10, skipping insertion in model container [2019-11-16 00:07:10,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:08" (2/3) ... [2019-11-16 00:07:10,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e851afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:10, skipping insertion in model container [2019-11-16 00:07:10,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:10" (3/3) ... [2019-11-16 00:07:10,575 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label46.c [2019-11-16 00:07:10,586 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:07:10,596 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:07:10,610 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:07:10,651 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:07:10,651 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:07:10,651 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:07:10,652 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:07:10,652 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:07:10,652 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:07:10,652 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:07:10,653 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:07:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-16 00:07:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:07:10,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:10,687 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] [2019-11-16 00:07:10,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:10,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2019-11-16 00:07:10,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:10,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916450392] [2019-11-16 00:07:10,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:10,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:10,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:11,076 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-16 00:07:11,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916450392] [2019-11-16 00:07:11,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:11,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:07:11,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585960153] [2019-11-16 00:07:11,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:07:11,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:11,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:07:11,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:11,102 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2019-11-16 00:07:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:13,769 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2019-11-16 00:07:13,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:07:13,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-16 00:07:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:13,801 INFO L225 Difference]: With dead ends: 852 [2019-11-16 00:07:13,801 INFO L226 Difference]: Without dead ends: 538 [2019-11-16 00:07:13,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-16 00:07:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-16 00:07:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-16 00:07:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2019-11-16 00:07:13,915 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 39 [2019-11-16 00:07:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:13,915 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2019-11-16 00:07:13,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:07:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2019-11-16 00:07:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-16 00:07:13,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:13,936 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-11-16 00:07:13,937 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1976295897, now seen corresponding path program 1 times [2019-11-16 00:07:13,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:13,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273198606] [2019-11-16 00:07:13,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:13,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:13,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-16 00:07:14,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273198606] [2019-11-16 00:07:14,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:14,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:14,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907020109] [2019-11-16 00:07:14,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:14,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:14,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:14,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:14,174 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2019-11-16 00:07:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:15,570 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2019-11-16 00:07:15,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:15,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-16 00:07:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:15,578 INFO L225 Difference]: With dead ends: 1252 [2019-11-16 00:07:15,578 INFO L226 Difference]: Without dead ends: 894 [2019-11-16 00:07:15,580 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-16 00:07:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-11-16 00:07:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2019-11-16 00:07:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-11-16 00:07:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2019-11-16 00:07:15,634 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 187 [2019-11-16 00:07:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:15,637 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2019-11-16 00:07:15,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2019-11-16 00:07:15,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-16 00:07:15,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:15,645 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-11-16 00:07:15,645 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:15,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:15,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1989656586, now seen corresponding path program 1 times [2019-11-16 00:07:15,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:15,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850383410] [2019-11-16 00:07:15,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:15,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:15,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 140 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:07:16,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850383410] [2019-11-16 00:07:16,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61375730] [2019-11-16 00:07:16,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:16,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:07:16,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-16 00:07:16,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:16,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-16 00:07:16,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721213691] [2019-11-16 00:07:16,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:16,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:16,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:16,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:16,289 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 3 states. [2019-11-16 00:07:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:17,234 INFO L93 Difference]: Finished difference Result 2320 states and 3245 transitions. [2019-11-16 00:07:17,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:17,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-11-16 00:07:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:17,246 INFO L225 Difference]: With dead ends: 2320 [2019-11-16 00:07:17,246 INFO L226 Difference]: Without dead ends: 1606 [2019-11-16 00:07:17,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-16 00:07:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-16 00:07:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-16 00:07:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1842 transitions. [2019-11-16 00:07:17,287 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1842 transitions. Word has length 210 [2019-11-16 00:07:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:17,289 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1842 transitions. [2019-11-16 00:07:17,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1842 transitions. [2019-11-16 00:07:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-16 00:07:17,295 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:17,295 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, 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, 3, 3, 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] [2019-11-16 00:07:17,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:17,509 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1040958891, now seen corresponding path program 1 times [2019-11-16 00:07:17,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:17,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578166603] [2019-11-16 00:07:17,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 248 proven. 4 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-16 00:07:17,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578166603] [2019-11-16 00:07:17,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973911679] [2019-11-16 00:07:17,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:18,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:07:18,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-16 00:07:18,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:18,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-16 00:07:18,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767819481] [2019-11-16 00:07:18,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:18,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:18,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:18,151 INFO L87 Difference]: Start difference. First operand 1428 states and 1842 transitions. Second operand 3 states. [2019-11-16 00:07:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:18,996 INFO L93 Difference]: Finished difference Result 3388 states and 4517 transitions. [2019-11-16 00:07:18,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:18,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-11-16 00:07:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:19,010 INFO L225 Difference]: With dead ends: 3388 [2019-11-16 00:07:19,010 INFO L226 Difference]: Without dead ends: 2140 [2019-11-16 00:07:19,012 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-16 00:07:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2019-11-16 00:07:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-16 00:07:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2478 transitions. [2019-11-16 00:07:19,055 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2478 transitions. Word has length 309 [2019-11-16 00:07:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:19,056 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2478 transitions. [2019-11-16 00:07:19,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2478 transitions. [2019-11-16 00:07:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-11-16 00:07:19,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:19,063 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, 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, 3, 3, 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] [2019-11-16 00:07:19,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:19,275 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:19,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1776950710, now seen corresponding path program 1 times [2019-11-16 00:07:19,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:19,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275656358] [2019-11-16 00:07:19,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:19,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:19,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 248 proven. 4 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-16 00:07:19,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275656358] [2019-11-16 00:07:19,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218838226] [2019-11-16 00:07:19,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:19,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:07:19,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-16 00:07:19,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:19,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:07:19,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415822075] [2019-11-16 00:07:19,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:19,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:19,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:19,954 INFO L87 Difference]: Start difference. First operand 1962 states and 2478 transitions. Second operand 4 states. [2019-11-16 00:07:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:20,990 INFO L93 Difference]: Finished difference Result 3951 states and 5007 transitions. [2019-11-16 00:07:20,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:20,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-11-16 00:07:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:21,004 INFO L225 Difference]: With dead ends: 3951 [2019-11-16 00:07:21,005 INFO L226 Difference]: Without dead ends: 2140 [2019-11-16 00:07:21,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 327 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-16 00:07:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-16 00:07:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2019-11-16 00:07:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-16 00:07:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2178 transitions. [2019-11-16 00:07:21,071 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2178 transitions. Word has length 328 [2019-11-16 00:07:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:21,072 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2178 transitions. [2019-11-16 00:07:21,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2178 transitions. [2019-11-16 00:07:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-11-16 00:07:21,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:21,089 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:21,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:21,298 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:21,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1745090076, now seen corresponding path program 1 times [2019-11-16 00:07:21,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:21,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453073898] [2019-11-16 00:07:21,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:21,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:21,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 419 proven. 65 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-11-16 00:07:22,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453073898] [2019-11-16 00:07:22,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817265426] [2019-11-16 00:07:22,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:22,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:07:22,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-16 00:07:22,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:22,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-16 00:07:22,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391523754] [2019-11-16 00:07:22,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:07:22,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:07:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:07:22,591 INFO L87 Difference]: Start difference. First operand 1962 states and 2178 transitions. Second operand 7 states. [2019-11-16 00:07:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:23,538 INFO L93 Difference]: Finished difference Result 3972 states and 4416 transitions. [2019-11-16 00:07:23,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:07:23,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 423 [2019-11-16 00:07:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:23,551 INFO L225 Difference]: With dead ends: 3972 [2019-11-16 00:07:23,551 INFO L226 Difference]: Without dead ends: 2140 [2019-11-16 00:07:23,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 418 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:07:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-16 00:07:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2019-11-16 00:07:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-16 00:07:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2130 transitions. [2019-11-16 00:07:23,604 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2130 transitions. Word has length 423 [2019-11-16 00:07:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:23,604 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2130 transitions. [2019-11-16 00:07:23,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:07:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2130 transitions. [2019-11-16 00:07:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-11-16 00:07:23,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:23,610 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:23,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:23,827 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:23,828 INFO L82 PathProgramCache]: Analyzing trace with hash 482320211, now seen corresponding path program 1 times [2019-11-16 00:07:23,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:23,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010277294] [2019-11-16 00:07:23,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:23,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:23,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-16 00:07:24,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010277294] [2019-11-16 00:07:24,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:24,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:24,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974858318] [2019-11-16 00:07:24,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:24,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:24,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:24,337 INFO L87 Difference]: Start difference. First operand 1962 states and 2130 transitions. Second operand 4 states. [2019-11-16 00:07:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:25,505 INFO L93 Difference]: Finished difference Result 5168 states and 5693 transitions. [2019-11-16 00:07:25,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:25,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-11-16 00:07:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:25,524 INFO L225 Difference]: With dead ends: 5168 [2019-11-16 00:07:25,524 INFO L226 Difference]: Without dead ends: 3386 [2019-11-16 00:07:25,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 00:07:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2019-11-16 00:07:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3208. [2019-11-16 00:07:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-11-16 00:07:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3480 transitions. [2019-11-16 00:07:25,608 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3480 transitions. Word has length 526 [2019-11-16 00:07:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:25,609 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 3480 transitions. [2019-11-16 00:07:25,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3480 transitions. [2019-11-16 00:07:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-11-16 00:07:25,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:25,618 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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] [2019-11-16 00:07:25,618 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1579274014, now seen corresponding path program 1 times [2019-11-16 00:07:25,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:25,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577977380] [2019-11-16 00:07:25,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-16 00:07:26,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577977380] [2019-11-16 00:07:26,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:26,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:07:26,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802741546] [2019-11-16 00:07:26,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:07:26,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:26,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:07:26,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:26,802 INFO L87 Difference]: Start difference. First operand 3208 states and 3480 transitions. Second operand 8 states. [2019-11-16 00:07:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:27,872 INFO L93 Difference]: Finished difference Result 6432 states and 6979 transitions. [2019-11-16 00:07:27,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:07:27,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 596 [2019-11-16 00:07:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:27,891 INFO L225 Difference]: With dead ends: 6432 [2019-11-16 00:07:27,892 INFO L226 Difference]: Without dead ends: 3404 [2019-11-16 00:07:27,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:07:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-11-16 00:07:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3208. [2019-11-16 00:07:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-11-16 00:07:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3476 transitions. [2019-11-16 00:07:27,975 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3476 transitions. Word has length 596 [2019-11-16 00:07:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:27,976 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 3476 transitions. [2019-11-16 00:07:27,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:07:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3476 transitions. [2019-11-16 00:07:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2019-11-16 00:07:27,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:27,985 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:27,986 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1906346804, now seen corresponding path program 1 times [2019-11-16 00:07:27,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:27,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19561152] [2019-11-16 00:07:27,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:27,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:27,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 687 proven. 45 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-16 00:07:29,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19561152] [2019-11-16 00:07:29,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758349917] [2019-11-16 00:07:29,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:07:29,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2019-11-16 00:07:29,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:29,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-16 00:07:29,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895944322] [2019-11-16 00:07:29,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:29,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:29,915 INFO L87 Difference]: Start difference. First operand 3208 states and 3476 transitions. Second operand 3 states. [2019-11-16 00:07:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:30,582 INFO L93 Difference]: Finished difference Result 7660 states and 8292 transitions. [2019-11-16 00:07:30,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:30,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 664 [2019-11-16 00:07:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:30,606 INFO L225 Difference]: With dead ends: 7660 [2019-11-16 00:07:30,607 INFO L226 Difference]: Without dead ends: 4632 [2019-11-16 00:07:30,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-16 00:07:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 3920. [2019-11-16 00:07:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-16 00:07:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4194 transitions. [2019-11-16 00:07:30,706 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4194 transitions. Word has length 664 [2019-11-16 00:07:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:30,708 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4194 transitions. [2019-11-16 00:07:30,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4194 transitions. [2019-11-16 00:07:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-11-16 00:07:30,719 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:30,721 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, 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, 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, 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, 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] [2019-11-16 00:07:30,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:30,926 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash 945691275, now seen corresponding path program 1 times [2019-11-16 00:07:30,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:30,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260691581] [2019-11-16 00:07:30,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 761 proven. 45 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2019-11-16 00:07:32,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260691581] [2019-11-16 00:07:32,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249804517] [2019-11-16 00:07:32,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:32,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:07:32,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 806 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2019-11-16 00:07:32,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:32,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-16 00:07:32,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693226173] [2019-11-16 00:07:32,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:32,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:32,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:32,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:32,574 INFO L87 Difference]: Start difference. First operand 3920 states and 4194 transitions. Second operand 3 states. [2019-11-16 00:07:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:33,115 INFO L93 Difference]: Finished difference Result 8372 states and 8972 transitions. [2019-11-16 00:07:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:33,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2019-11-16 00:07:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:33,133 INFO L225 Difference]: With dead ends: 8372 [2019-11-16 00:07:33,133 INFO L226 Difference]: Without dead ends: 4632 [2019-11-16 00:07:33,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-16 00:07:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2019-11-16 00:07:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-16 00:07:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4933 transitions. [2019-11-16 00:07:33,230 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4933 transitions. Word has length 669 [2019-11-16 00:07:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:33,231 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4933 transitions. [2019-11-16 00:07:33,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4933 transitions. [2019-11-16 00:07:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2019-11-16 00:07:33,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:33,246 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:33,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:33,450 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1584602280, now seen corresponding path program 1 times [2019-11-16 00:07:33,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:33,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713974608] [2019-11-16 00:07:33,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:33,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:33,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 1172 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-11-16 00:07:34,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713974608] [2019-11-16 00:07:34,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:34,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:34,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024273147] [2019-11-16 00:07:34,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:34,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:34,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:34,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:34,189 INFO L87 Difference]: Start difference. First operand 4632 states and 4933 transitions. Second operand 3 states. [2019-11-16 00:07:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:34,823 INFO L93 Difference]: Finished difference Result 10330 states and 11011 transitions. [2019-11-16 00:07:34,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:34,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 714 [2019-11-16 00:07:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:34,850 INFO L225 Difference]: With dead ends: 10330 [2019-11-16 00:07:34,850 INFO L226 Difference]: Without dead ends: 5878 [2019-11-16 00:07:34,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-11-16 00:07:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5522. [2019-11-16 00:07:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-16 00:07:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5863 transitions. [2019-11-16 00:07:34,926 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5863 transitions. Word has length 714 [2019-11-16 00:07:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:34,927 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5863 transitions. [2019-11-16 00:07:34,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5863 transitions. [2019-11-16 00:07:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2019-11-16 00:07:34,939 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:34,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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:34,940 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1269972873, now seen corresponding path program 1 times [2019-11-16 00:07:34,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:34,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475787443] [2019-11-16 00:07:34,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:34,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:34,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2103 backedges. 1427 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-11-16 00:07:35,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475787443] [2019-11-16 00:07:35,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:35,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:35,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456360047] [2019-11-16 00:07:35,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:35,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:35,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:35,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:35,570 INFO L87 Difference]: Start difference. First operand 5522 states and 5863 transitions. Second operand 3 states. [2019-11-16 00:07:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:36,085 INFO L93 Difference]: Finished difference Result 10864 states and 11541 transitions. [2019-11-16 00:07:36,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:36,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 786 [2019-11-16 00:07:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:36,101 INFO L225 Difference]: With dead ends: 10864 [2019-11-16 00:07:36,101 INFO L226 Difference]: Without dead ends: 5522 [2019-11-16 00:07:36,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2019-11-16 00:07:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5522. [2019-11-16 00:07:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-16 00:07:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5834 transitions. [2019-11-16 00:07:36,189 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5834 transitions. Word has length 786 [2019-11-16 00:07:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:36,190 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5834 transitions. [2019-11-16 00:07:36,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5834 transitions. [2019-11-16 00:07:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2019-11-16 00:07:36,203 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:36,204 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:36,204 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash -928636369, now seen corresponding path program 1 times [2019-11-16 00:07:36,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:36,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138302607] [2019-11-16 00:07:36,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:36,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:36,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1135 proven. 4 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2019-11-16 00:07:37,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138302607] [2019-11-16 00:07:37,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054665938] [2019-11-16 00:07:37,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:37,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:07:37,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:37,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1116 proven. 23 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2019-11-16 00:07:39,148 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:39,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-16 00:07:39,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324998809] [2019-11-16 00:07:39,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:07:39,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:39,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:07:39,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:39,156 INFO L87 Difference]: Start difference. First operand 5522 states and 5834 transitions. Second operand 8 states. [2019-11-16 00:07:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:41,053 INFO L93 Difference]: Finished difference Result 11485 states and 12113 transitions. [2019-11-16 00:07:41,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:07:41,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 870 [2019-11-16 00:07:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:41,064 INFO L225 Difference]: With dead ends: 11485 [2019-11-16 00:07:41,065 INFO L226 Difference]: Without dead ends: 6143 [2019-11-16 00:07:41,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 867 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-16 00:07:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2019-11-16 00:07:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5522. [2019-11-16 00:07:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-16 00:07:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5833 transitions. [2019-11-16 00:07:41,169 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5833 transitions. Word has length 870 [2019-11-16 00:07:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:41,170 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5833 transitions. [2019-11-16 00:07:41,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:07:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5833 transitions. [2019-11-16 00:07:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 960 [2019-11-16 00:07:41,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:41,186 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, 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, 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, 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, 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] [2019-11-16 00:07:41,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:41,394 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash -754416928, now seen corresponding path program 1 times [2019-11-16 00:07:41,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:41,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204834194] [2019-11-16 00:07:41,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:41,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:41,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1955 proven. 0 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2019-11-16 00:07:43,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204834194] [2019-11-16 00:07:43,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:43,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:07:43,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492017271] [2019-11-16 00:07:43,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:07:43,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:07:43,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:43,749 INFO L87 Difference]: Start difference. First operand 5522 states and 5833 transitions. Second operand 7 states. [2019-11-16 00:07:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:45,017 INFO L93 Difference]: Finished difference Result 11223 states and 11847 transitions. [2019-11-16 00:07:45,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:07:45,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 959 [2019-11-16 00:07:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:45,028 INFO L225 Difference]: With dead ends: 11223 [2019-11-16 00:07:45,028 INFO L226 Difference]: Without dead ends: 5881 [2019-11-16 00:07:45,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:45,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2019-11-16 00:07:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5522. [2019-11-16 00:07:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-16 00:07:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5828 transitions. [2019-11-16 00:07:45,130 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5828 transitions. Word has length 959 [2019-11-16 00:07:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:45,131 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5828 transitions. [2019-11-16 00:07:45,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:07:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5828 transitions. [2019-11-16 00:07:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2019-11-16 00:07:45,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:45,151 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, 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, 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, 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, 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] [2019-11-16 00:07:45,151 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1310024199, now seen corresponding path program 1 times [2019-11-16 00:07:45,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:45,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994346643] [2019-11-16 00:07:45,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:45,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:45,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 2408 proven. 140 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2019-11-16 00:07:46,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994346643] [2019-11-16 00:07:46,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399875828] [2019-11-16 00:07:46,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:46,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:07:46,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:46,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:46,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:46,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 2485 proven. 616 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-11-16 00:07:47,830 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:47,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-16 00:07:47,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200721524] [2019-11-16 00:07:47,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:07:47,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:07:47,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:47,833 INFO L87 Difference]: Start difference. First operand 5522 states and 5828 transitions. Second operand 7 states. [2019-11-16 00:07:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:49,951 INFO L93 Difference]: Finished difference Result 12288 states and 12967 transitions. [2019-11-16 00:07:49,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:07:49,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1036 [2019-11-16 00:07:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:49,964 INFO L225 Difference]: With dead ends: 12288 [2019-11-16 00:07:49,964 INFO L226 Difference]: Without dead ends: 6946 [2019-11-16 00:07:49,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1048 GetRequests, 1037 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:07:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-11-16 00:07:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5878. [2019-11-16 00:07:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2019-11-16 00:07:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6137 transitions. [2019-11-16 00:07:50,071 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6137 transitions. Word has length 1036 [2019-11-16 00:07:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:50,072 INFO L462 AbstractCegarLoop]: Abstraction has 5878 states and 6137 transitions. [2019-11-16 00:07:50,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:07:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6137 transitions. [2019-11-16 00:07:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1184 [2019-11-16 00:07:50,089 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:50,090 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 6, 5, 5, 4, 4, 4, 4, 4, 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, 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] [2019-11-16 00:07:50,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:50,307 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1616010734, now seen corresponding path program 1 times [2019-11-16 00:07:50,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:50,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710708613] [2019-11-16 00:07:50,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:50,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:50,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2672 proven. 6 refuted. 0 times theorem prover too weak. 1985 trivial. 0 not checked. [2019-11-16 00:07:52,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710708613] [2019-11-16 00:07:52,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250735010] [2019-11-16 00:07:52,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:07:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:52,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:07:52,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 1978 proven. 0 refuted. 0 times theorem prover too weak. 2685 trivial. 0 not checked. [2019-11-16 00:07:53,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:53,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:07:53,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168135592] [2019-11-16 00:07:53,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:53,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:53,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:53,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:53,713 INFO L87 Difference]: Start difference. First operand 5878 states and 6137 transitions. Second operand 4 states. [2019-11-16 00:07:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:54,500 INFO L93 Difference]: Finished difference Result 11754 states and 12278 transitions. [2019-11-16 00:07:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:54,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1183 [2019-11-16 00:07:54,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:54,510 INFO L225 Difference]: With dead ends: 11754 [2019-11-16 00:07:54,510 INFO L226 Difference]: Without dead ends: 6056 [2019-11-16 00:07:54,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1187 GetRequests, 1182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-11-16 00:07:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2019-11-16 00:07:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-16 00:07:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6304 transitions. [2019-11-16 00:07:54,601 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6304 transitions. Word has length 1183 [2019-11-16 00:07:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:54,602 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6304 transitions. [2019-11-16 00:07:54,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6304 transitions. [2019-11-16 00:07:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1605 [2019-11-16 00:07:54,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:54,632 INFO L380 BasicCegarLoop]: trace histogram [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, 14, 14, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 6, 6, 6, 6, 6, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:54,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:54,837 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 836341823, now seen corresponding path program 1 times [2019-11-16 00:07:54,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:54,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982701953] [2019-11-16 00:07:54,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:54,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:54,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8329 backedges. 2654 proven. 0 refuted. 0 times theorem prover too weak. 5675 trivial. 0 not checked. [2019-11-16 00:07:58,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982701953] [2019-11-16 00:07:58,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:58,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:07:58,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374451335] [2019-11-16 00:07:58,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:07:58,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:58,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:07:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:58,648 INFO L87 Difference]: Start difference. First operand 6056 states and 6304 transitions. Second operand 7 states. [2019-11-16 00:07:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:59,610 INFO L93 Difference]: Finished difference Result 12052 states and 12547 transitions. [2019-11-16 00:07:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:07:59,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1604 [2019-11-16 00:07:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:59,619 INFO L225 Difference]: With dead ends: 12052 [2019-11-16 00:07:59,619 INFO L226 Difference]: Without dead ends: 6056 [2019-11-16 00:07:59,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 00:07:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-11-16 00:07:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2019-11-16 00:07:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-16 00:07:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6297 transitions. [2019-11-16 00:07:59,707 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6297 transitions. Word has length 1604 [2019-11-16 00:07:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:59,708 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6297 transitions. [2019-11-16 00:07:59,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:07:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6297 transitions. [2019-11-16 00:07:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1636 [2019-11-16 00:07:59,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:59,736 INFO L380 BasicCegarLoop]: trace histogram [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, 14, 14, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:59,737 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1212840288, now seen corresponding path program 1 times [2019-11-16 00:07:59,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:59,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394679343] [2019-11-16 00:07:59,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8526 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 8046 trivial. 0 not checked. [2019-11-16 00:08:01,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394679343] [2019-11-16 00:08:01,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:01,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:01,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670356640] [2019-11-16 00:08:01,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:01,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:01,911 INFO L87 Difference]: Start difference. First operand 6056 states and 6297 transitions. Second operand 4 states. [2019-11-16 00:08:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:02,789 INFO L93 Difference]: Finished difference Result 11932 states and 12413 transitions. [2019-11-16 00:08:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:02,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1635 [2019-11-16 00:08:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:02,797 INFO L225 Difference]: With dead ends: 11932 [2019-11-16 00:08:02,798 INFO L226 Difference]: Without dead ends: 6056 [2019-11-16 00:08:02,804 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-16 00:08:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-11-16 00:08:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2019-11-16 00:08:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-16 00:08:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6270 transitions. [2019-11-16 00:08:02,879 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6270 transitions. Word has length 1635 [2019-11-16 00:08:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:02,881 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6270 transitions. [2019-11-16 00:08:02,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6270 transitions. [2019-11-16 00:08:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1672 [2019-11-16 00:08:02,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:02,910 INFO L380 BasicCegarLoop]: trace histogram [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, 14, 14, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 7, 7, 7, 6, 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, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:02,911 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:02,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1342838487, now seen corresponding path program 1 times [2019-11-16 00:08:02,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:02,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165092519] [2019-11-16 00:08:02,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8572 backedges. 2675 proven. 0 refuted. 0 times theorem prover too weak. 5897 trivial. 0 not checked. [2019-11-16 00:08:06,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165092519] [2019-11-16 00:08:06,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:06,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:08:06,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459845310] [2019-11-16 00:08:06,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:08:06,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:06,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:08:06,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:06,727 INFO L87 Difference]: Start difference. First operand 6056 states and 6270 transitions. Second operand 7 states. [2019-11-16 00:08:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:07,799 INFO L93 Difference]: Finished difference Result 12052 states and 12479 transitions. [2019-11-16 00:08:07,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:07,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1671 [2019-11-16 00:08:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:07,804 INFO L225 Difference]: With dead ends: 12052 [2019-11-16 00:08:07,804 INFO L226 Difference]: Without dead ends: 6056 [2019-11-16 00:08:07,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 00:08:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-11-16 00:08:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2019-11-16 00:08:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-16 00:08:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6266 transitions. [2019-11-16 00:08:07,864 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6266 transitions. Word has length 1671 [2019-11-16 00:08:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:07,865 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6266 transitions. [2019-11-16 00:08:07,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:08:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6266 transitions. [2019-11-16 00:08:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1730 [2019-11-16 00:08:07,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:07,892 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:07,892 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:07,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash 19375012, now seen corresponding path program 1 times [2019-11-16 00:08:07,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:07,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964470847] [2019-11-16 00:08:07,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9775 backedges. 6624 proven. 30 refuted. 0 times theorem prover too weak. 3121 trivial. 0 not checked. [2019-11-16 00:08:11,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964470847] [2019-11-16 00:08:11,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707882438] [2019-11-16 00:08:11,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/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-16 00:08:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:11,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:08:11,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9775 backedges. 2962 proven. 0 refuted. 0 times theorem prover too weak. 6813 trivial. 0 not checked. [2019-11-16 00:08:14,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:08:14,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:08:14,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709805419] [2019-11-16 00:08:14,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:14,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:14,830 INFO L87 Difference]: Start difference. First operand 6056 states and 6266 transitions. Second operand 4 states. [2019-11-16 00:08:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:15,744 INFO L93 Difference]: Finished difference Result 12288 states and 12719 transitions. [2019-11-16 00:08:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:15,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1729 [2019-11-16 00:08:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:15,749 INFO L225 Difference]: With dead ends: 12288 [2019-11-16 00:08:15,750 INFO L226 Difference]: Without dead ends: 6412 [2019-11-16 00:08:15,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1738 GetRequests, 1729 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-16 00:08:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6056. [2019-11-16 00:08:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-16 00:08:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6260 transitions. [2019-11-16 00:08:15,804 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6260 transitions. Word has length 1729 [2019-11-16 00:08:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:15,805 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6260 transitions. [2019-11-16 00:08:15,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6260 transitions. [2019-11-16 00:08:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1818 [2019-11-16 00:08:15,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:15,827 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 00:08:16,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:16,028 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1727618608, now seen corresponding path program 1 times [2019-11-16 00:08:16,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:16,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536760729] [2019-11-16 00:08:16,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:16,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:16,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10935 backedges. 2784 proven. 0 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2019-11-16 00:08:18,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536760729] [2019-11-16 00:08:18,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:18,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:08:18,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72291313] [2019-11-16 00:08:18,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:08:18,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:18,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:08:18,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:08:18,610 INFO L87 Difference]: Start difference. First operand 6056 states and 6260 transitions. Second operand 5 states. [2019-11-16 00:08:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:19,772 INFO L93 Difference]: Finished difference Result 14246 states and 14781 transitions. [2019-11-16 00:08:19,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:08:19,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1817 [2019-11-16 00:08:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:19,779 INFO L225 Difference]: With dead ends: 14246 [2019-11-16 00:08:19,779 INFO L226 Difference]: Without dead ends: 8370 [2019-11-16 00:08:19,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 00:08:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8370 states. [2019-11-16 00:08:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8370 to 6768. [2019-11-16 00:08:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6768 states. [2019-11-16 00:08:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6768 states to 6768 states and 7050 transitions. [2019-11-16 00:08:19,851 INFO L78 Accepts]: Start accepts. Automaton has 6768 states and 7050 transitions. Word has length 1817 [2019-11-16 00:08:19,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:19,853 INFO L462 AbstractCegarLoop]: Abstraction has 6768 states and 7050 transitions. [2019-11-16 00:08:19,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:08:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 6768 states and 7050 transitions. [2019-11-16 00:08:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1961 [2019-11-16 00:08:19,878 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:19,879 INFO L380 BasicCegarLoop]: trace histogram [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, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 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, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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-16 00:08:19,879 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash 798478165, now seen corresponding path program 1 times [2019-11-16 00:08:19,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:19,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151495750] [2019-11-16 00:08:19,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:19,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:19,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12664 backedges. 4301 proven. 0 refuted. 0 times theorem prover too weak. 8363 trivial. 0 not checked. [2019-11-16 00:08:23,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151495750] [2019-11-16 00:08:23,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:23,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:08:23,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117322667] [2019-11-16 00:08:23,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:08:23,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:23,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:08:23,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:23,850 INFO L87 Difference]: Start difference. First operand 6768 states and 7050 transitions. Second operand 7 states. [2019-11-16 00:08:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:24,594 INFO L93 Difference]: Finished difference Result 13337 states and 13885 transitions. [2019-11-16 00:08:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:24,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1960 [2019-11-16 00:08:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:24,600 INFO L225 Difference]: With dead ends: 13337 [2019-11-16 00:08:24,600 INFO L226 Difference]: Without dead ends: 6412 [2019-11-16 00:08:24,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 00:08:24,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-16 00:08:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6412. [2019-11-16 00:08:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6412 states. [2019-11-16 00:08:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 6665 transitions. [2019-11-16 00:08:24,682 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 6665 transitions. Word has length 1960 [2019-11-16 00:08:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:24,684 INFO L462 AbstractCegarLoop]: Abstraction has 6412 states and 6665 transitions. [2019-11-16 00:08:24,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:08:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 6665 transitions. [2019-11-16 00:08:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1988 [2019-11-16 00:08:24,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:24,711 INFO L380 BasicCegarLoop]: trace histogram [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, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 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, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 00:08:24,712 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:24,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1196899044, now seen corresponding path program 1 times [2019-11-16 00:08:24,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:24,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982577725] [2019-11-16 00:08:24,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:24,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:24,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12745 backedges. 4293 proven. 0 refuted. 0 times theorem prover too weak. 8452 trivial. 0 not checked. [2019-11-16 00:08:29,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982577725] [2019-11-16 00:08:29,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:29,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:08:29,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938820510] [2019-11-16 00:08:29,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:08:29,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:29,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:08:29,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:29,168 INFO L87 Difference]: Start difference. First operand 6412 states and 6665 transitions. Second operand 7 states. [2019-11-16 00:08:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:29,840 INFO L93 Difference]: Finished difference Result 12791 states and 13295 transitions. [2019-11-16 00:08:29,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:29,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1987 [2019-11-16 00:08:29,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:29,846 INFO L225 Difference]: With dead ends: 12791 [2019-11-16 00:08:29,846 INFO L226 Difference]: Without dead ends: 6234 [2019-11-16 00:08:29,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 00:08:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2019-11-16 00:08:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 6234. [2019-11-16 00:08:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2019-11-16 00:08:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6464 transitions. [2019-11-16 00:08:29,928 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6464 transitions. Word has length 1987 [2019-11-16 00:08:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:29,929 INFO L462 AbstractCegarLoop]: Abstraction has 6234 states and 6464 transitions. [2019-11-16 00:08:29,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:08:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6464 transitions. [2019-11-16 00:08:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2019 [2019-11-16 00:08:29,952 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:29,953 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, 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, 17, 17, 17, 17, 17, 17, 16, 16, 16, 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, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 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-16 00:08:29,953 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1233211586, now seen corresponding path program 1 times [2019-11-16 00:08:29,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:29,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431872242] [2019-11-16 00:08:29,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:29,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:29,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 9262 proven. 695 refuted. 0 times theorem prover too weak. 3867 trivial. 0 not checked. [2019-11-16 00:08:36,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431872242] [2019-11-16 00:08:36,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564335091] [2019-11-16 00:08:36,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:36,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 2442 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:08:36,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:36,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 9347 proven. 184 refuted. 0 times theorem prover too weak. 4293 trivial. 0 not checked. [2019-11-16 00:08:41,653 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:41,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-11-16 00:08:41,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617928134] [2019-11-16 00:08:41,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:08:41,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:08:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:08:41,656 INFO L87 Difference]: Start difference. First operand 6234 states and 6464 transitions. Second operand 9 states. [2019-11-16 00:08:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:43,632 INFO L93 Difference]: Finished difference Result 12915 states and 13377 transitions. [2019-11-16 00:08:43,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:08:43,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2018 [2019-11-16 00:08:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:43,638 INFO L225 Difference]: With dead ends: 12915 [2019-11-16 00:08:43,638 INFO L226 Difference]: Without dead ends: 6683 [2019-11-16 00:08:43,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2029 GetRequests, 2016 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:08:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2019-11-16 00:08:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 5878. [2019-11-16 00:08:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2019-11-16 00:08:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6023 transitions. [2019-11-16 00:08:43,703 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6023 transitions. Word has length 2018 [2019-11-16 00:08:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:43,705 INFO L462 AbstractCegarLoop]: Abstraction has 5878 states and 6023 transitions. [2019-11-16 00:08:43,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:08:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6023 transitions. [2019-11-16 00:08:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2031 [2019-11-16 00:08:43,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:43,730 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, 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, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 00:08:43,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:43,936 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:43,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1944323812, now seen corresponding path program 1 times [2019-11-16 00:08:43,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:43,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883357208] [2019-11-16 00:08:43,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:43,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:43,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13982 backedges. 4475 proven. 0 refuted. 0 times theorem prover too weak. 9507 trivial. 0 not checked. [2019-11-16 00:08:47,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883357208] [2019-11-16 00:08:47,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:47,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:47,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99243055] [2019-11-16 00:08:47,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:47,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:47,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:47,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:47,977 INFO L87 Difference]: Start difference. First operand 5878 states and 6023 transitions. Second operand 4 states. [2019-11-16 00:08:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:48,489 INFO L93 Difference]: Finished difference Result 11588 states and 11869 transitions. [2019-11-16 00:08:48,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:48,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2030 [2019-11-16 00:08:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:48,494 INFO L225 Difference]: With dead ends: 11588 [2019-11-16 00:08:48,494 INFO L226 Difference]: Without dead ends: 5700 [2019-11-16 00:08:48,497 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-16 00:08:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2019-11-16 00:08:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5700. [2019-11-16 00:08:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-11-16 00:08:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 5833 transitions. [2019-11-16 00:08:48,558 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 5833 transitions. Word has length 2030 [2019-11-16 00:08:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:48,560 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 5833 transitions. [2019-11-16 00:08:48,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 5833 transitions. [2019-11-16 00:08:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2120 [2019-11-16 00:08:48,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:48,586 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, 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, 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, 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-16 00:08:48,587 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:48,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:48,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2140269625, now seen corresponding path program 1 times [2019-11-16 00:08:48,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:48,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642332034] [2019-11-16 00:08:48,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:48,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:48,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14529 backedges. 3210 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2019-11-16 00:08:53,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642332034] [2019-11-16 00:08:53,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:53,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:08:53,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968423590] [2019-11-16 00:08:53,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:08:53,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:53,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:08:53,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:08:53,013 INFO L87 Difference]: Start difference. First operand 5700 states and 5833 transitions. Second operand 5 states. [2019-11-16 00:08:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:53,998 INFO L93 Difference]: Finished difference Result 11396 states and 11663 transitions. [2019-11-16 00:08:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:53,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2119 [2019-11-16 00:08:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:54,000 INFO L225 Difference]: With dead ends: 11396 [2019-11-16 00:08:54,000 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:08:54,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 00:08:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:08:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:08:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:08:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:08:54,005 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2119 [2019-11-16 00:08:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:54,006 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:08:54,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:08:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:08:54,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:08:54,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:08:54,522 WARN L191 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 413 DAG size of output: 292 [2019-11-16 00:08:54,949 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 413 DAG size of output: 292 [2019-11-16 00:08:57,004 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 259 DAG size of output: 113 [2019-11-16 00:08:58,893 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 259 DAG size of output: 113 [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:08:58,896 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:08:58,897 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-16 00:08:58,898 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-16 00:08:58,898 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-16 00:08:58,898 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,898 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,898 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,898 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-11-16 00:08:58,898 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-16 00:08:58,898 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:08:58,898 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,899 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,900 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,901 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,902 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,902 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-16 00:08:58,902 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:08:58,902 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:08:58,902 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:08:58,902 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-16 00:08:58,902 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-16 00:08:58,902 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-16 00:08:58,902 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-16 00:08:58,903 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-16 00:08:58,904 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,905 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-16 00:08:58,906 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,907 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:08:58,908 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-16 00:08:58,909 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,910 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,910 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse23 (<= ~a21~0 6)) (.cse21 (< 11 ~a12~0)) (.cse7 (<= 10 ~a21~0)) (.cse19 (<= ~a15~0 8))) (let ((.cse27 (+ ~a12~0 43)) (.cse24 (or (and .cse21 .cse19 .cse23) (and .cse21 .cse7 .cse19))) (.cse5 (= ~a24~0 1))) (let ((.cse0 (and .cse21 .cse5 .cse19)) (.cse15 (= ~a15~0 5)) (.cse13 (and .cse24 .cse5)) (.cse14 (= ~a21~0 10)) (.cse3 (<= ~a12~0 586307)) (.cse22 (and (<= .cse27 0) .cse19 .cse23)) (.cse12 (= ~a21~0 7)) (.cse16 (= ~a21~0 6)) (.cse4 (= ~a15~0 6)) (.cse9 (= 9 ~a15~0)) (.cse1 (= 7 ~a15~0)) (.cse17 (<= (+ ~a12~0 44) 0)) (.cse18 (= 8 ~a21~0)) (.cse20 (and .cse7 .cse5 .cse19)) (.cse2 (= ~a21~0 9)) (.cse11 (= 8 ~a15~0)) (.cse6 (<= ~a12~0 11)) (.cse8 (< 0 .cse27)) (.cse10 (let ((.cse26 (div (+ ~a12~0 (- 600066)) 5))) (or (and (let ((.cse25 (+ ~a12~0 4))) (= (* 5 (div .cse25 5)) .cse25)) (<= (+ .cse26 13) 0)) (<= (+ .cse26 14) 0))))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2 .cse4) (and .cse5 .cse6 .cse2 .cse4) (and .cse7 .cse5 .cse8 .cse9 .cse10) (and .cse11 .cse5 .cse12 .cse6 .cse8) (and .cse13 .cse14 .cse15) (and .cse16 .cse5 .cse15) (and .cse17 .cse18 .cse5 .cse19) (and .cse17 .cse20) (and (<= ~a12~0 80) .cse21 .cse5 .cse19) (and .cse17 .cse5 .cse12 .cse19) (and (and .cse22 .cse5) .cse17) (and (= ~a15~0 7) .cse13 .cse14) (and .cse21 .cse5 .cse3 .cse9 .cse23) (and .cse22 (<= (+ ~a12~0 9352) 0)) (and (or (and .cse18 .cse5 .cse8 .cse9) (and .cse21 .cse5 .cse12 .cse9)) .cse10) (and (and (and .cse7 .cse5) .cse9) .cse17) (and .cse17 .cse18 .cse5 .cse9) (and .cse16 .cse24 .cse5 .cse4) (and .cse5 (< 80 ~a12~0) .cse9 .cse2 .cse10) (and .cse5 .cse19 .cse23 .cse8 .cse10) (and (and (not .cse1) .cse5 .cse19) .cse17) (and (and (and .cse21 .cse18 .cse19) .cse5) .cse10) (and .cse8 (and .cse6 .cse20)) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse2 .cse11 .cse5 .cse6 .cse8) (and (and (and (= ~a15~0 8) (and .cse21 .cse7)) .cse5) .cse10))))) [2019-11-16 00:08:58,910 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-16 00:08:58,910 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-16 00:08:58,910 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:08:58,911 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-16 00:08:58,912 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,913 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,913 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-16 00:08:58,913 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,913 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-16 00:08:58,913 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse23 (<= ~a21~0 6)) (.cse21 (< 11 ~a12~0)) (.cse7 (<= 10 ~a21~0)) (.cse19 (<= ~a15~0 8))) (let ((.cse27 (+ ~a12~0 43)) (.cse24 (or (and .cse21 .cse19 .cse23) (and .cse21 .cse7 .cse19))) (.cse5 (= ~a24~0 1))) (let ((.cse0 (and .cse21 .cse5 .cse19)) (.cse15 (= ~a15~0 5)) (.cse13 (and .cse24 .cse5)) (.cse14 (= ~a21~0 10)) (.cse3 (<= ~a12~0 586307)) (.cse22 (and (<= .cse27 0) .cse19 .cse23)) (.cse12 (= ~a21~0 7)) (.cse16 (= ~a21~0 6)) (.cse4 (= ~a15~0 6)) (.cse9 (= 9 ~a15~0)) (.cse1 (= 7 ~a15~0)) (.cse17 (<= (+ ~a12~0 44) 0)) (.cse18 (= 8 ~a21~0)) (.cse20 (and .cse7 .cse5 .cse19)) (.cse2 (= ~a21~0 9)) (.cse11 (= 8 ~a15~0)) (.cse6 (<= ~a12~0 11)) (.cse8 (< 0 .cse27)) (.cse10 (let ((.cse26 (div (+ ~a12~0 (- 600066)) 5))) (or (and (let ((.cse25 (+ ~a12~0 4))) (= (* 5 (div .cse25 5)) .cse25)) (<= (+ .cse26 13) 0)) (<= (+ .cse26 14) 0))))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2 .cse4) (and .cse5 .cse6 .cse2 .cse4) (and .cse7 .cse5 .cse8 .cse9 .cse10) (and .cse11 .cse5 .cse12 .cse6 .cse8) (and .cse13 .cse14 .cse15) (and .cse16 .cse5 .cse15) (and .cse17 .cse18 .cse5 .cse19) (and .cse17 .cse20) (and (<= ~a12~0 80) .cse21 .cse5 .cse19) (and .cse17 .cse5 .cse12 .cse19) (and (and .cse22 .cse5) .cse17) (and (= ~a15~0 7) .cse13 .cse14) (and .cse21 .cse5 .cse3 .cse9 .cse23) (and .cse22 (<= (+ ~a12~0 9352) 0)) (and (or (and .cse18 .cse5 .cse8 .cse9) (and .cse21 .cse5 .cse12 .cse9)) .cse10) (and (and (and .cse7 .cse5) .cse9) .cse17) (and .cse17 .cse18 .cse5 .cse9) (and .cse16 .cse24 .cse5 .cse4) (and .cse5 (< 80 ~a12~0) .cse9 .cse2 .cse10) (and .cse5 .cse19 .cse23 .cse8 .cse10) (and (and (not .cse1) .cse5 .cse19) .cse17) (and (and (and .cse21 .cse18 .cse19) .cse5) .cse10) (and .cse8 (and .cse6 .cse20)) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse2 .cse11 .cse5 .cse6 .cse8) (and (and (and (= ~a15~0 8) (and .cse21 .cse7)) .cse5) .cse10))))) [2019-11-16 00:08:58,913 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-16 00:08:58,913 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-16 00:08:58,913 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:08:58,914 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:08:58,915 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-16 00:08:58,916 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-16 00:08:58,917 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-16 00:08:58,917 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-16 00:08:58,917 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-16 00:08:58,917 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,917 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,917 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-16 00:08:58,918 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-16 00:08:58,918 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:08:58,918 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:08:58,918 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:08:58,918 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-16 00:08:58,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:08:58 BoogieIcfgContainer [2019-11-16 00:08:58,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:08:58,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:08:58,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:08:58,963 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:08:58,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:10" (3/4) ... [2019-11-16 00:08:58,968 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:08:58,997 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:08:58,999 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:08:59,214 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2c07f53c-cd81-4528-9390-5a5e0ee922da/bin/uautomizer/witness.graphml [2019-11-16 00:08:59,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:08:59,216 INFO L168 Benchmark]: Toolchain (without parser) took 111718.54 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 939.4 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 879.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:59,217 INFO L168 Benchmark]: CDTParser took 0.32 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-16 00:08:59,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:59,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.54 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.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:59,218 INFO L168 Benchmark]: Boogie Preprocessor took 130.71 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:59,219 INFO L168 Benchmark]: RCFGBuilder took 1938.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 945.2 MB in the end (delta: 133.3 MB). Peak memory consumption was 133.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:59,219 INFO L168 Benchmark]: TraceAbstraction took 108401.04 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 945.2 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:08:59,220 INFO L168 Benchmark]: Witness Printer took 251.83 ms. Allocated memory is still 5.0 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:59,223 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.32 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 862.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.54 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.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.71 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1938.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 945.2 MB in the end (delta: 133.3 MB). Peak memory consumption was 133.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108401.04 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 945.2 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 251.83 ms. Allocated memory is still 5.0 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: 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 Derived loop invariant: ((((((((((((((((((((((((((((11 < a12 && a24 == 1) && a15 <= 8) && 7 == a15) && a21 == 9) || (((((11 < a12 && a24 == 1) && a15 <= 8) && a12 <= 586307) && a21 == 9) && a15 == 6)) || (((a24 == 1 && a12 <= 11) && a21 == 9) && a15 == 6)) || ((((10 <= a21 && a24 == 1) && 0 < a12 + 43) && 9 == a15) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || ((((8 == a15 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8)) && a24 == 1) && a21 == 10) && a15 == 5)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 + 44 <= 0 && 8 == a21) && a24 == 1) && a15 <= 8)) || (a12 + 44 <= 0 && (10 <= a21 && a24 == 1) && a15 <= 8)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 <= 8)) || (((a12 + 44 <= 0 && a24 == 1) && a21 == 7) && a15 <= 8)) || ((((a12 + 43 <= 0 && a15 <= 8) && a21 <= 6) && a24 == 1) && a12 + 44 <= 0)) || ((a15 == 7 && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8)) && a24 == 1) && a21 == 10)) || ((((11 < a12 && a24 == 1) && a12 <= 586307) && 9 == a15) && a21 <= 6)) || (((a12 + 43 <= 0 && a15 <= 8) && a21 <= 6) && a12 + 9352 <= 0)) || (((((8 == a21 && a24 == 1) && 0 < a12 + 43) && 9 == a15) || (((11 < a12 && a24 == 1) && a21 == 7) && 9 == a15)) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || (((10 <= a21 && a24 == 1) && 9 == a15) && a12 + 44 <= 0)) || (((a12 + 44 <= 0 && 8 == a21) && a24 == 1) && 9 == a15)) || (((a21 == 6 && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8))) && a24 == 1) && a15 == 6)) || ((((a24 == 1 && 80 < a12) && 9 == a15) && a21 == 9) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || ((((a24 == 1 && a15 <= 8) && a21 <= 6) && 0 < a12 + 43) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || (((!(7 == a15) && a24 == 1) && a15 <= 8) && a12 + 44 <= 0)) || ((((11 < a12 && 8 == a21) && a15 <= 8) && a24 == 1) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || (0 < a12 + 43 && a12 <= 11 && (10 <= a21 && a24 == 1) && a15 <= 8)) || (((((!(5 == input) && a21 == 9) && 8 == a15) && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (((a15 == 8 && 11 < a12 && 10 <= a21) && a24 == 1) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((11 < a12 && a24 == 1) && a15 <= 8) && 7 == a15) && a21 == 9) || (((((11 < a12 && a24 == 1) && a15 <= 8) && a12 <= 586307) && a21 == 9) && a15 == 6)) || (((a24 == 1 && a12 <= 11) && a21 == 9) && a15 == 6)) || ((((10 <= a21 && a24 == 1) && 0 < a12 + 43) && 9 == a15) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || ((((8 == a15 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8)) && a24 == 1) && a21 == 10) && a15 == 5)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 + 44 <= 0 && 8 == a21) && a24 == 1) && a15 <= 8)) || (a12 + 44 <= 0 && (10 <= a21 && a24 == 1) && a15 <= 8)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 <= 8)) || (((a12 + 44 <= 0 && a24 == 1) && a21 == 7) && a15 <= 8)) || ((((a12 + 43 <= 0 && a15 <= 8) && a21 <= 6) && a24 == 1) && a12 + 44 <= 0)) || ((a15 == 7 && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8)) && a24 == 1) && a21 == 10)) || ((((11 < a12 && a24 == 1) && a12 <= 586307) && 9 == a15) && a21 <= 6)) || (((a12 + 43 <= 0 && a15 <= 8) && a21 <= 6) && a12 + 9352 <= 0)) || (((((8 == a21 && a24 == 1) && 0 < a12 + 43) && 9 == a15) || (((11 < a12 && a24 == 1) && a21 == 7) && 9 == a15)) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || (((10 <= a21 && a24 == 1) && 9 == a15) && a12 + 44 <= 0)) || (((a12 + 44 <= 0 && 8 == a21) && a24 == 1) && 9 == a15)) || (((a21 == 6 && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8))) && a24 == 1) && a15 == 6)) || ((((a24 == 1 && 80 < a12) && 9 == a15) && a21 == 9) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || ((((a24 == 1 && a15 <= 8) && a21 <= 6) && 0 < a12 + 43) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || (((!(7 == a15) && a24 == 1) && a15 <= 8) && a12 + 44 <= 0)) || ((((11 < a12 && 8 == a21) && a15 <= 8) && a24 == 1) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || (0 < a12 + 43 && a12 <= 11 && (10 <= a21 && a24 == 1) && a15 <= 8)) || (((((!(5 == input) && a21 == 9) && 8 == a15) && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (((a15 == 8 && 11 < a12 && 10 <= a21) && a24 == 1) && ((5 * ((a12 + 4) / 5) == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0)) - 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: 108.2s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, HoareTripleCheckerStatistics: 1329 SDtfs, 7297 SDslu, 355 SDs, 0 SdLazy, 23252 SolverSat, 2269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9588 GetRequests, 9446 SyntacticMatches, 14 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6768occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 6965 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 98 NumberOfFragments, 1341 HoareAnnotationTreeSize, 3 FomulaSimplifications, 51596 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 21964 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 37508 NumberOfCodeBlocks, 37508 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 37471 ConstructedInterpolants, 0 QuantifiedInterpolants, 169897312 SizeOfPredicates, 20 NumberOfNonLiveVariables, 11640 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 37 InterpolantComputations, 23 PerfectInterpolantSequences, 172138/174003 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...