./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label30.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_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label30.c -s /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/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 8d242fd154f76fbbdca66276c5caf34f74dcc939 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:50:15,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:50:15,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:50:15,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:50:15,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:50:15,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:50:15,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:50:15,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:50:15,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:50:15,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:50:15,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:50:15,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:50:15,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:50:15,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:50:15,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:50:15,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:50:15,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:50:15,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:50:15,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:50:15,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:50:15,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:50:15,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:50:15,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:50:15,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:50:15,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:50:15,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:50:15,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:50:15,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:50:15,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:50:15,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:50:15,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:50:15,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:50:15,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:50:15,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:50:15,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:50:15,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:50:15,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:50:15,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:50:15,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:50:15,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:50:15,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:50:15,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:50:15,467 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:50:15,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:50:15,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:50:15,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:50:15,479 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:50:15,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:50:15,479 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:50:15,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:50:15,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:50:15,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:50:15,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:50:15,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:50:15,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:50:15,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:50:15,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:50:15,482 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:50:15,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:50:15,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:50:15,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:50:15,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:50:15,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:50:15,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:50:15,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:50:15,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:50:15,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:50:15,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:50:15,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:50:15,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:50:15,486 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_eeb99155-5f08-4f36-949c-6668a69b5499/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 -> 8d242fd154f76fbbdca66276c5caf34f74dcc939 [2019-11-15 23:50:15,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:50:15,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:50:15,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:50:15,538 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:50:15,538 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:50:15,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2019-11-15 23:50:15,615 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/data/820be5a11/27448d0dfba348ddb305c40de1c5dddb/FLAGdf67cc98b [2019-11-15 23:50:16,114 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:50:16,114 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2019-11-15 23:50:16,130 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/data/820be5a11/27448d0dfba348ddb305c40de1c5dddb/FLAGdf67cc98b [2019-11-15 23:50:16,354 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/data/820be5a11/27448d0dfba348ddb305c40de1c5dddb [2019-11-15 23:50:16,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:50:16,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:50:16,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:16,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:50:16,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:50:16,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:16" (1/1) ... [2019-11-15 23:50:16,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2e0d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:16, skipping insertion in model container [2019-11-15 23:50:16,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:16" (1/1) ... [2019-11-15 23:50:16,375 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:50:16,442 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:50:17,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:17,051 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:50:17,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:17,288 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:50:17,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17 WrapperNode [2019-11-15 23:50:17,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:17,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:50:17,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:50:17,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:50:17,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... [2019-11-15 23:50:17,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... [2019-11-15 23:50:17,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:50:17,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:50:17,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:50:17,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:50:17,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... [2019-11-15 23:50:17,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... [2019-11-15 23:50:17,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... [2019-11-15 23:50:17,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... [2019-11-15 23:50:17,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... [2019-11-15 23:50:17,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... [2019-11-15 23:50:17,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... [2019-11-15 23:50:17,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:50:17,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:50:17,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:50:17,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:50:17,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:50:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:50:17,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:50:19,609 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:50:19,609 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:50:19,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:19 BoogieIcfgContainer [2019-11-15 23:50:19,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:50:19,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:50:19,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:50:19,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:50:19,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:50:16" (1/3) ... [2019-11-15 23:50:19,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156b2e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:50:19, skipping insertion in model container [2019-11-15 23:50:19,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:17" (2/3) ... [2019-11-15 23:50:19,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156b2e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:50:19, skipping insertion in model container [2019-11-15 23:50:19,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:19" (3/3) ... [2019-11-15 23:50:19,619 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label30.c [2019-11-15 23:50:19,629 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:50:19,637 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:50:19,648 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:50:19,675 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:50:19,675 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:50:19,675 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:50:19,675 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:50:19,675 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:50:19,675 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:50:19,676 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:50:19,676 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:50:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 23:50:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:50:19,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:19,705 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] [2019-11-15 23:50:19,707 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:19,713 INFO L82 PathProgramCache]: Analyzing trace with hash -748286455, now seen corresponding path program 1 times [2019-11-15 23:50:19,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:19,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117433980] [2019-11-15 23:50:19,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:19,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:19,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:20,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117433980] [2019-11-15 23:50:20,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:20,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:20,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017039843] [2019-11-15 23:50:20,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:20,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:20,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:20,159 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 23:50:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:22,778 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-11-15 23:50:22,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:22,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-15 23:50:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:22,797 INFO L225 Difference]: With dead ends: 973 [2019-11-15 23:50:22,797 INFO L226 Difference]: Without dead ends: 607 [2019-11-15 23:50:22,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-11-15 23:50:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-11-15 23:50:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-15 23:50:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-11-15 23:50:22,894 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 29 [2019-11-15 23:50:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:22,895 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-11-15 23:50:22,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-11-15 23:50:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:50:22,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:22,903 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:22,907 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash -618924976, now seen corresponding path program 1 times [2019-11-15 23:50:22,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:22,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647242898] [2019-11-15 23:50:22,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:22,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:22,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:23,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647242898] [2019-11-15 23:50:23,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:23,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:23,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894620077] [2019-11-15 23:50:23,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:23,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:23,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:23,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:23,091 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-11-15 23:50:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:24,929 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-11-15 23:50:24,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:24,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 23:50:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:24,940 INFO L225 Difference]: With dead ends: 2328 [2019-11-15 23:50:24,941 INFO L226 Difference]: Without dead ends: 1726 [2019-11-15 23:50:24,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-11-15 23:50:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-11-15 23:50:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-15 23:50:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-11-15 23:50:25,021 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 97 [2019-11-15 23:50:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:25,022 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-11-15 23:50:25,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-11-15 23:50:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 23:50:25,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:25,026 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:25,027 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1171000047, now seen corresponding path program 1 times [2019-11-15 23:50:25,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:25,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518717351] [2019-11-15 23:50:25,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:25,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:25,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:25,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518717351] [2019-11-15 23:50:25,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:25,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:50:25,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432992709] [2019-11-15 23:50:25,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:25,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:25,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:25,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:25,172 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-11-15 23:50:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:26,219 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-11-15 23:50:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:26,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-15 23:50:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:26,237 INFO L225 Difference]: With dead ends: 4707 [2019-11-15 23:50:26,237 INFO L226 Difference]: Without dead ends: 2999 [2019-11-15 23:50:26,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 23:50:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-11-15 23:50:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-11-15 23:50:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-11-15 23:50:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-11-15 23:50:26,325 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 123 [2019-11-15 23:50:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:26,326 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-11-15 23:50:26,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-11-15 23:50:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 23:50:26,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:26,333 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:26,333 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:26,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1063098843, now seen corresponding path program 1 times [2019-11-15 23:50:26,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:26,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469872845] [2019-11-15 23:50:26,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:26,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:26,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 23:50:26,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469872845] [2019-11-15 23:50:26,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169565446] [2019-11-15 23:50:26,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:26,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:26,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 23:50:26,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:26,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-15 23:50:26,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293517818] [2019-11-15 23:50:26,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:26,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:26,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:26,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:26,791 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 3 states. [2019-11-15 23:50:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:27,881 INFO L93 Difference]: Finished difference Result 7658 states and 9369 transitions. [2019-11-15 23:50:27,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:27,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-15 23:50:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:27,910 INFO L225 Difference]: With dead ends: 7658 [2019-11-15 23:50:27,910 INFO L226 Difference]: Without dead ends: 4661 [2019-11-15 23:50:27,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2019-11-15 23:50:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 4660. [2019-11-15 23:50:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-11-15 23:50:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 5631 transitions. [2019-11-15 23:50:28,035 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 5631 transitions. Word has length 151 [2019-11-15 23:50:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:28,037 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 5631 transitions. [2019-11-15 23:50:28,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 5631 transitions. [2019-11-15 23:50:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 23:50:28,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:28,040 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:28,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:28,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash 786326133, now seen corresponding path program 1 times [2019-11-15 23:50:28,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:28,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627547507] [2019-11-15 23:50:28,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:28,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:28,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:28,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627547507] [2019-11-15 23:50:28,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:28,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:28,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231973006] [2019-11-15 23:50:28,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:28,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:28,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:28,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:28,413 INFO L87 Difference]: Start difference. First operand 4660 states and 5631 transitions. Second operand 4 states. [2019-11-15 23:50:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:30,517 INFO L93 Difference]: Finished difference Result 10812 states and 13165 transitions. [2019-11-15 23:50:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:30,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-15 23:50:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:30,557 INFO L225 Difference]: With dead ends: 10812 [2019-11-15 23:50:30,557 INFO L226 Difference]: Without dead ends: 6338 [2019-11-15 23:50:30,564 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-15 23:50:30,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2019-11-15 23:50:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 5948. [2019-11-15 23:50:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5948 states. [2019-11-15 23:50:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5948 states to 5948 states and 7113 transitions. [2019-11-15 23:50:30,727 INFO L78 Accepts]: Start accepts. Automaton has 5948 states and 7113 transitions. Word has length 156 [2019-11-15 23:50:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:30,728 INFO L462 AbstractCegarLoop]: Abstraction has 5948 states and 7113 transitions. [2019-11-15 23:50:30,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 5948 states and 7113 transitions. [2019-11-15 23:50:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-15 23:50:30,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:30,735 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:30,735 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1660657955, now seen corresponding path program 1 times [2019-11-15 23:50:30,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:30,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990157530] [2019-11-15 23:50:30,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:31,225 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-11-15 23:50:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:31,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990157530] [2019-11-15 23:50:31,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401382239] [2019-11-15 23:50:31,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:31,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:50:31,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:31,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:31,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:32,047 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:50:32,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-11-15 23:50:32,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445152073] [2019-11-15 23:50:32,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:50:32,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:50:32,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:50:32,050 INFO L87 Difference]: Start difference. First operand 5948 states and 7113 transitions. Second operand 9 states. [2019-11-15 23:50:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:44,301 INFO L93 Difference]: Finished difference Result 22414 states and 26719 transitions. [2019-11-15 23:50:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:50:44,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 241 [2019-11-15 23:50:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:44,390 INFO L225 Difference]: With dead ends: 22414 [2019-11-15 23:50:44,390 INFO L226 Difference]: Without dead ends: 15731 [2019-11-15 23:50:44,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:50:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15731 states. [2019-11-15 23:50:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15731 to 13137. [2019-11-15 23:50:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13137 states. [2019-11-15 23:50:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13137 states to 13137 states and 15303 transitions. [2019-11-15 23:50:44,685 INFO L78 Accepts]: Start accepts. Automaton has 13137 states and 15303 transitions. Word has length 241 [2019-11-15 23:50:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:44,686 INFO L462 AbstractCegarLoop]: Abstraction has 13137 states and 15303 transitions. [2019-11-15 23:50:44,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:50:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 13137 states and 15303 transitions. [2019-11-15 23:50:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-15 23:50:44,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:44,700 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, 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, 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] [2019-11-15 23:50:44,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:44,905 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:44,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:44,905 INFO L82 PathProgramCache]: Analyzing trace with hash 378186544, now seen corresponding path program 1 times [2019-11-15 23:50:44,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:44,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242791557] [2019-11-15 23:50:44,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:44,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:44,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-11-15 23:50:45,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242791557] [2019-11-15 23:50:45,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:45,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:45,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194051080] [2019-11-15 23:50:45,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:45,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:45,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:45,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:45,239 INFO L87 Difference]: Start difference. First operand 13137 states and 15303 transitions. Second operand 4 states. [2019-11-15 23:50:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:46,737 INFO L93 Difference]: Finished difference Result 29035 states and 34026 transitions. [2019-11-15 23:50:46,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:46,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-11-15 23:50:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:46,771 INFO L225 Difference]: With dead ends: 29035 [2019-11-15 23:50:46,771 INFO L226 Difference]: Without dead ends: 16268 [2019-11-15 23:50:46,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16268 states. [2019-11-15 23:50:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16268 to 14610. [2019-11-15 23:50:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14610 states. [2019-11-15 23:50:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14610 states to 14610 states and 16866 transitions. [2019-11-15 23:50:47,031 INFO L78 Accepts]: Start accepts. Automaton has 14610 states and 16866 transitions. Word has length 306 [2019-11-15 23:50:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:47,032 INFO L462 AbstractCegarLoop]: Abstraction has 14610 states and 16866 transitions. [2019-11-15 23:50:47,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 14610 states and 16866 transitions. [2019-11-15 23:50:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-11-15 23:50:47,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:47,048 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:47,049 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:47,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2019684113, now seen corresponding path program 1 times [2019-11-15 23:50:47,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:47,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600806853] [2019-11-15 23:50:47,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:47,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:47,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-15 23:50:47,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600806853] [2019-11-15 23:50:47,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:47,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:47,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129126834] [2019-11-15 23:50:47,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:47,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:47,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:47,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:47,323 INFO L87 Difference]: Start difference. First operand 14610 states and 16866 transitions. Second operand 4 states. [2019-11-15 23:50:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:49,161 INFO L93 Difference]: Finished difference Result 32007 states and 37021 transitions. [2019-11-15 23:50:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:49,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-11-15 23:50:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:49,199 INFO L225 Difference]: With dead ends: 32007 [2019-11-15 23:50:49,199 INFO L226 Difference]: Without dead ends: 17767 [2019-11-15 23:50:49,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17767 states. [2019-11-15 23:50:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17767 to 15898. [2019-11-15 23:50:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15898 states. [2019-11-15 23:50:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15898 states to 15898 states and 18202 transitions. [2019-11-15 23:50:49,464 INFO L78 Accepts]: Start accepts. Automaton has 15898 states and 18202 transitions. Word has length 311 [2019-11-15 23:50:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:49,465 INFO L462 AbstractCegarLoop]: Abstraction has 15898 states and 18202 transitions. [2019-11-15 23:50:49,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 15898 states and 18202 transitions. [2019-11-15 23:50:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-15 23:50:49,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:49,479 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:49,479 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:49,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:49,480 INFO L82 PathProgramCache]: Analyzing trace with hash 586529090, now seen corresponding path program 1 times [2019-11-15 23:50:49,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:49,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171212403] [2019-11-15 23:50:49,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:49,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:49,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 23:50:49,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171212403] [2019-11-15 23:50:49,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:49,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:49,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336011534] [2019-11-15 23:50:49,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:49,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:49,753 INFO L87 Difference]: Start difference. First operand 15898 states and 18202 transitions. Second operand 4 states. [2019-11-15 23:50:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:51,051 INFO L93 Difference]: Finished difference Result 29968 states and 34520 transitions. [2019-11-15 23:50:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:51,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-11-15 23:50:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:51,089 INFO L225 Difference]: With dead ends: 29968 [2019-11-15 23:50:51,089 INFO L226 Difference]: Without dead ends: 17023 [2019-11-15 23:50:51,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17023 states. [2019-11-15 23:50:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17023 to 16455. [2019-11-15 23:50:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16455 states. [2019-11-15 23:50:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16455 states to 16455 states and 18776 transitions. [2019-11-15 23:50:51,340 INFO L78 Accepts]: Start accepts. Automaton has 16455 states and 18776 transitions. Word has length 315 [2019-11-15 23:50:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:51,343 INFO L462 AbstractCegarLoop]: Abstraction has 16455 states and 18776 transitions. [2019-11-15 23:50:51,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 16455 states and 18776 transitions. [2019-11-15 23:50:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-15 23:50:51,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:51,361 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:51,361 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:51,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:51,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1565769179, now seen corresponding path program 1 times [2019-11-15 23:50:51,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:51,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423830192] [2019-11-15 23:50:51,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:51,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:51,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-15 23:50:51,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423830192] [2019-11-15 23:50:51,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:51,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:51,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466421781] [2019-11-15 23:50:51,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:51,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:51,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:51,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:51,759 INFO L87 Difference]: Start difference. First operand 16455 states and 18776 transitions. Second operand 4 states. [2019-11-15 23:50:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:53,431 INFO L93 Difference]: Finished difference Result 34395 states and 39151 transitions. [2019-11-15 23:50:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:53,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-11-15 23:50:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:53,464 INFO L225 Difference]: With dead ends: 34395 [2019-11-15 23:50:53,464 INFO L226 Difference]: Without dead ends: 18126 [2019-11-15 23:50:53,476 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-15 23:50:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18126 states. [2019-11-15 23:50:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18126 to 16638. [2019-11-15 23:50:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16638 states. [2019-11-15 23:50:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16638 states to 16638 states and 18633 transitions. [2019-11-15 23:50:53,700 INFO L78 Accepts]: Start accepts. Automaton has 16638 states and 18633 transitions. Word has length 326 [2019-11-15 23:50:53,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:53,701 INFO L462 AbstractCegarLoop]: Abstraction has 16638 states and 18633 transitions. [2019-11-15 23:50:53,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand 16638 states and 18633 transitions. [2019-11-15 23:50:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-15 23:50:53,713 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:53,715 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:53,715 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:53,716 INFO L82 PathProgramCache]: Analyzing trace with hash -139580508, now seen corresponding path program 1 times [2019-11-15 23:50:53,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:53,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856016232] [2019-11-15 23:50:53,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:53,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:53,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 276 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 23:50:54,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856016232] [2019-11-15 23:50:54,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092134668] [2019-11-15 23:50:54,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:54,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:50:54,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 23:50:54,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:54,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 23:50:54,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147698130] [2019-11-15 23:50:54,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:54,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:54,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:54,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:50:54,450 INFO L87 Difference]: Start difference. First operand 16638 states and 18633 transitions. Second operand 4 states. [2019-11-15 23:50:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:55,557 INFO L93 Difference]: Finished difference Result 33280 states and 37274 transitions. [2019-11-15 23:50:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:55,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-11-15 23:50:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:55,575 INFO L225 Difference]: With dead ends: 33280 [2019-11-15 23:50:55,575 INFO L226 Difference]: Without dead ends: 16644 [2019-11-15 23:50:55,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 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-15 23:50:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16644 states. [2019-11-15 23:50:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16644 to 15534. [2019-11-15 23:50:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15534 states. [2019-11-15 23:50:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15534 states to 15534 states and 17280 transitions. [2019-11-15 23:50:55,791 INFO L78 Accepts]: Start accepts. Automaton has 15534 states and 17280 transitions. Word has length 331 [2019-11-15 23:50:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:55,792 INFO L462 AbstractCegarLoop]: Abstraction has 15534 states and 17280 transitions. [2019-11-15 23:50:55,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 15534 states and 17280 transitions. [2019-11-15 23:50:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-15 23:50:55,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:55,804 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, 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, 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] [2019-11-15 23:50:56,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:56,016 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:56,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2055586056, now seen corresponding path program 1 times [2019-11-15 23:50:56,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:56,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510076381] [2019-11-15 23:50:56,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:56,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:56,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 211 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:56,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510076381] [2019-11-15 23:50:56,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550523503] [2019-11-15 23:50:56,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:56,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:50:56,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:56,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:56,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:56,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:56,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:56,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:56,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:56,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:56,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:56,901 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 27 [2019-11-15 23:50:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 80 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 23:50:57,474 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:50:57,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-11-15 23:50:57,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074043342] [2019-11-15 23:50:57,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:50:57,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:57,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:50:57,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:50:57,476 INFO L87 Difference]: Start difference. First operand 15534 states and 17280 transitions. Second operand 10 states. [2019-11-15 23:51:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:05,790 INFO L93 Difference]: Finished difference Result 37361 states and 41769 transitions. [2019-11-15 23:51:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:51:05,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 338 [2019-11-15 23:51:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:05,808 INFO L225 Difference]: With dead ends: 37361 [2019-11-15 23:51:05,808 INFO L226 Difference]: Without dead ends: 24043 [2019-11-15 23:51:05,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:51:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24043 states. [2019-11-15 23:51:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24043 to 16827. [2019-11-15 23:51:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16827 states. [2019-11-15 23:51:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16827 states to 16827 states and 18772 transitions. [2019-11-15 23:51:06,047 INFO L78 Accepts]: Start accepts. Automaton has 16827 states and 18772 transitions. Word has length 338 [2019-11-15 23:51:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:06,048 INFO L462 AbstractCegarLoop]: Abstraction has 16827 states and 18772 transitions. [2019-11-15 23:51:06,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:51:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 16827 states and 18772 transitions. [2019-11-15 23:51:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-15 23:51:06,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:06,059 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 23:51:06,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:06,262 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:06,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1174714697, now seen corresponding path program 1 times [2019-11-15 23:51:06,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:06,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687278122] [2019-11-15 23:51:06,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:06,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:06,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 23:51:06,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687278122] [2019-11-15 23:51:06,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:06,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:06,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547574265] [2019-11-15 23:51:06,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:06,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:06,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:06,568 INFO L87 Difference]: Start difference. First operand 16827 states and 18772 transitions. Second operand 5 states. [2019-11-15 23:51:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:08,239 INFO L93 Difference]: Finished difference Result 37708 states and 42058 transitions. [2019-11-15 23:51:08,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:51:08,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 356 [2019-11-15 23:51:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:08,256 INFO L225 Difference]: With dead ends: 37708 [2019-11-15 23:51:08,256 INFO L226 Difference]: Without dead ends: 21987 [2019-11-15 23:51:08,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21987 states. [2019-11-15 23:51:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21987 to 18101. [2019-11-15 23:51:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18101 states. [2019-11-15 23:51:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18101 states to 18101 states and 19801 transitions. [2019-11-15 23:51:08,590 INFO L78 Accepts]: Start accepts. Automaton has 18101 states and 19801 transitions. Word has length 356 [2019-11-15 23:51:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:08,591 INFO L462 AbstractCegarLoop]: Abstraction has 18101 states and 19801 transitions. [2019-11-15 23:51:08,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 18101 states and 19801 transitions. [2019-11-15 23:51:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-11-15 23:51:08,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:08,606 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:08,606 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:08,607 INFO L82 PathProgramCache]: Analyzing trace with hash -174982330, now seen corresponding path program 1 times [2019-11-15 23:51:08,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:08,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102349904] [2019-11-15 23:51:08,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:08,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:08,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-11-15 23:51:08,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102349904] [2019-11-15 23:51:08,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:08,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:08,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685752570] [2019-11-15 23:51:08,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:08,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:08,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:08,898 INFO L87 Difference]: Start difference. First operand 18101 states and 19801 transitions. Second operand 3 states. [2019-11-15 23:51:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:09,911 INFO L93 Difference]: Finished difference Result 21047 states and 22928 transitions. [2019-11-15 23:51:09,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:09,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 424 [2019-11-15 23:51:09,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:09,932 INFO L225 Difference]: With dead ends: 21047 [2019-11-15 23:51:09,932 INFO L226 Difference]: Without dead ends: 21045 [2019-11-15 23:51:09,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21045 states. [2019-11-15 23:51:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21045 to 18469. [2019-11-15 23:51:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-11-15 23:51:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 20203 transitions. [2019-11-15 23:51:10,195 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 20203 transitions. Word has length 424 [2019-11-15 23:51:10,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:10,196 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 20203 transitions. [2019-11-15 23:51:10,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 20203 transitions. [2019-11-15 23:51:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-11-15 23:51:10,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:10,215 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:10,215 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1385650959, now seen corresponding path program 1 times [2019-11-15 23:51:10,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:10,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438086814] [2019-11-15 23:51:10,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:10,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:10,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 299 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:51:11,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438086814] [2019-11-15 23:51:11,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498109648] [2019-11-15 23:51:11,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:11,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:51:11,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:11,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:11,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-15 23:51:11,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:51:11,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-11-15 23:51:11,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711030696] [2019-11-15 23:51:11,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:11,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:11,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:51:11,978 INFO L87 Difference]: Start difference. First operand 18469 states and 20203 transitions. Second operand 4 states. [2019-11-15 23:51:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:13,715 INFO L93 Difference]: Finished difference Result 42469 states and 46508 transitions. [2019-11-15 23:51:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:13,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 489 [2019-11-15 23:51:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:13,739 INFO L225 Difference]: With dead ends: 42469 [2019-11-15 23:51:13,740 INFO L226 Difference]: Without dead ends: 24370 [2019-11-15 23:51:13,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 488 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:51:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24370 states. [2019-11-15 23:51:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24370 to 21600. [2019-11-15 23:51:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21600 states. [2019-11-15 23:51:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21600 states to 21600 states and 23450 transitions. [2019-11-15 23:51:13,981 INFO L78 Accepts]: Start accepts. Automaton has 21600 states and 23450 transitions. Word has length 489 [2019-11-15 23:51:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:13,982 INFO L462 AbstractCegarLoop]: Abstraction has 21600 states and 23450 transitions. [2019-11-15 23:51:13,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 21600 states and 23450 transitions. [2019-11-15 23:51:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-11-15 23:51:13,997 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:13,998 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:14,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:14,202 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 439563746, now seen corresponding path program 1 times [2019-11-15 23:51:14,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:14,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658127050] [2019-11-15 23:51:14,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:14,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:14,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 646 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-11-15 23:51:14,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658127050] [2019-11-15 23:51:14,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:14,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:14,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596042873] [2019-11-15 23:51:14,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:14,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:14,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:14,598 INFO L87 Difference]: Start difference. First operand 21600 states and 23450 transitions. Second operand 4 states. [2019-11-15 23:51:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:15,801 INFO L93 Difference]: Finished difference Result 42293 states and 45938 transitions. [2019-11-15 23:51:15,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:15,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 541 [2019-11-15 23:51:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:15,818 INFO L225 Difference]: With dead ends: 42293 [2019-11-15 23:51:15,818 INFO L226 Difference]: Without dead ends: 22907 [2019-11-15 23:51:15,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22907 states. [2019-11-15 23:51:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22907 to 21600. [2019-11-15 23:51:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21600 states. [2019-11-15 23:51:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21600 states to 21600 states and 23340 transitions. [2019-11-15 23:51:16,043 INFO L78 Accepts]: Start accepts. Automaton has 21600 states and 23340 transitions. Word has length 541 [2019-11-15 23:51:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:16,043 INFO L462 AbstractCegarLoop]: Abstraction has 21600 states and 23340 transitions. [2019-11-15 23:51:16,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 21600 states and 23340 transitions. [2019-11-15 23:51:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-11-15 23:51:16,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:16,056 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:16,056 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash 881604247, now seen corresponding path program 1 times [2019-11-15 23:51:16,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:16,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792250751] [2019-11-15 23:51:16,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:16,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:16,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 630 proven. 144 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-15 23:51:17,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792250751] [2019-11-15 23:51:17,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341375456] [2019-11-15 23:51:17,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:17,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:51:17,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:17,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:17,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:17,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:17,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:17,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 720 proven. 54 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-15 23:51:18,010 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:51:18,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-15 23:51:18,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484277634] [2019-11-15 23:51:18,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:51:18,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:18,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:51:18,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:51:18,012 INFO L87 Difference]: Start difference. First operand 21600 states and 23340 transitions. Second operand 11 states. [2019-11-15 23:51:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:28,975 INFO L93 Difference]: Finished difference Result 51142 states and 55190 transitions. [2019-11-15 23:51:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:51:28,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 566 [2019-11-15 23:51:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:29,000 INFO L225 Difference]: With dead ends: 51142 [2019-11-15 23:51:29,000 INFO L226 Difference]: Without dead ends: 29912 [2019-11-15 23:51:29,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:51:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29912 states. [2019-11-15 23:51:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29912 to 22888. [2019-11-15 23:51:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22888 states. [2019-11-15 23:51:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22888 states to 22888 states and 24485 transitions. [2019-11-15 23:51:29,290 INFO L78 Accepts]: Start accepts. Automaton has 22888 states and 24485 transitions. Word has length 566 [2019-11-15 23:51:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:29,291 INFO L462 AbstractCegarLoop]: Abstraction has 22888 states and 24485 transitions. [2019-11-15 23:51:29,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:51:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 22888 states and 24485 transitions. [2019-11-15 23:51:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-11-15 23:51:29,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:29,314 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 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] [2019-11-15 23:51:29,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:29,518 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:29,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1107746161, now seen corresponding path program 1 times [2019-11-15 23:51:29,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:29,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272484590] [2019-11-15 23:51:29,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:29,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:29,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 603 proven. 0 refuted. 0 times theorem prover too weak. 1052 trivial. 0 not checked. [2019-11-15 23:51:30,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272484590] [2019-11-15 23:51:30,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:30,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:30,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712215058] [2019-11-15 23:51:30,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:30,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:30,372 INFO L87 Difference]: Start difference. First operand 22888 states and 24485 transitions. Second operand 4 states. [2019-11-15 23:51:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:31,434 INFO L93 Difference]: Finished difference Result 42463 states and 45394 transitions. [2019-11-15 23:51:31,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:31,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 748 [2019-11-15 23:51:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:31,449 INFO L225 Difference]: With dead ends: 42463 [2019-11-15 23:51:31,450 INFO L226 Difference]: Without dead ends: 19945 [2019-11-15 23:51:31,458 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-15 23:51:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19945 states. [2019-11-15 23:51:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19945 to 13304. [2019-11-15 23:51:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13304 states. [2019-11-15 23:51:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13304 states to 13304 states and 14191 transitions. [2019-11-15 23:51:31,617 INFO L78 Accepts]: Start accepts. Automaton has 13304 states and 14191 transitions. Word has length 748 [2019-11-15 23:51:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:31,618 INFO L462 AbstractCegarLoop]: Abstraction has 13304 states and 14191 transitions. [2019-11-15 23:51:31,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 13304 states and 14191 transitions. [2019-11-15 23:51:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2019-11-15 23:51:31,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:31,632 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:31,632 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:31,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:31,633 INFO L82 PathProgramCache]: Analyzing trace with hash 904594841, now seen corresponding path program 1 times [2019-11-15 23:51:31,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:31,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412963234] [2019-11-15 23:51:31,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3180 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 2965 trivial. 0 not checked. [2019-11-15 23:51:33,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412963234] [2019-11-15 23:51:33,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:33,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:51:33,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998363201] [2019-11-15 23:51:33,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:33,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:33,176 INFO L87 Difference]: Start difference. First operand 13304 states and 14191 transitions. Second operand 3 states. [2019-11-15 23:51:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:33,602 INFO L93 Difference]: Finished difference Result 25125 states and 26814 transitions. [2019-11-15 23:51:33,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:33,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1015 [2019-11-15 23:51:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:33,603 INFO L225 Difference]: With dead ends: 25125 [2019-11-15 23:51:33,603 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:51:33,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:51:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:51:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:51:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:51:33,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1015 [2019-11-15 23:51:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:33,611 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:51:33,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:51:33,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:51:33,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:51:34,780 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 677 DAG size of output: 484 [2019-11-15 23:51:35,583 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 677 DAG size of output: 484 [2019-11-15 23:51:38,980 WARN L191 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 450 DAG size of output: 145 [2019-11-15 23:51:42,020 WARN L191 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 450 DAG size of output: 145 [2019-11-15 23:51:42,022 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 23:51:42,022 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 23:51:42,022 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 23:51:42,023 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 23:51:42,024 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse25 (+ ~a23~0 43)) (.cse21 (< 277 ~a29~0)) (.cse18 (= 10 ~a25~0)) (.cse6 (<= ~a25~0 12)) (.cse17 (<= ~a29~0 130)) (.cse13 (= ~a25~0 11))) (let ((.cse10 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230)) (.cse8 (exists ((v_~a23~0_474 Int)) (let ((.cse27 (div v_~a23~0_474 5))) (and (= (mod v_~a23~0_474 5) 0) (<= ~a23~0 (+ (mod (* .cse27 4) 83) 180)) (<= 312 v_~a23~0_474) (<= 0 (* 4 .cse27)))))) (.cse5 (not .cse13)) (.cse0 (and .cse6 .cse17)) (.cse23 (<= 260 ~a29~0)) (.cse14 (< 138 ~a23~0)) (.cse24 (<= ~a29~0 275)) (.cse19 (<= 141 ~a29~0)) (.cse1 (<= ~a25~0 9)) (.cse11 (and .cse21 (not .cse18))) (.cse12 (<= ~a23~0 312)) (.cse16 (= ~a4~0 1)) (.cse3 (= ~a25~0 9)) (.cse22 (<= ~a29~0 245)) (.cse20 (= 12 ~a25~0)) (.cse15 (<= (+ ~a29~0 193245) 0)) (.cse4 (= 15 ~a8~0)) (.cse9 (= ~a25~0 13)) (.cse2 (= 1 ~a4~0)) (.cse26 (<= 130 ~a29~0)) (.cse7 (<= .cse25 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and (and .cse5 .cse6 .cse2) .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse2) (and .cse12 .cse4 .cse2 .cse13 .cse14) (and .cse5 (<= (+ (* 5 ~a29~0) ~a23~0) 1687) .cse15 .cse6 .cse4 .cse16) (and .cse9 .cse12 .cse4 (or .cse10 (<= ~a23~0 306))) (and .cse8 .cse9 .cse17 .cse2) (and .cse18 .cse4 .cse2 .cse14) (and (or (and .cse2 .cse13 .cse14 .cse19) (and .cse20 (< 140 ~a29~0) (<= ~a29~0 277) .cse2 .cse14)) .cse4) (and .cse3 (and .cse21 .cse7) .cse4) (and .cse12 .cse18 .cse4 .cse22) (and .cse17 .cse18 .cse4) (and .cse4 (and (and .cse12 .cse1 .cse2) .cse23)) (and (and .cse5 .cse12 .cse0 .cse2) .cse4) (and .cse18 .cse4 .cse7) (and (and (and .cse1 .cse24 .cse2) .cse23) .cse4) (and .cse12 .cse3 (< 0 .cse25) .cse4 .cse22) (and .cse12 .cse20 .cse4 .cse14) (and (and .cse9 (exists ((v_~a29~0_505 Int)) (and (<= v_~a29~0_505 140) (<= ~a29~0 (+ (div v_~a29~0_505 5) 206649)) (<= 0 v_~a29~0_505))) .cse2) .cse4) (and .cse4 (and (and (or .cse20 (and .cse2 .cse13)) .cse24) .cse19)) (and (or (and (or (and .cse18 .cse21) (and .cse11 .cse13)) .cse2) (and .cse1 .cse11 .cse2)) .cse4) (and .cse12 (and .cse20 (not .cse16)) .cse4) (and .cse7 .cse3 .cse15 .cse4) (and .cse4 .cse13 .cse7) (and .cse22 .cse2 .cse26 .cse7) (and .cse20 (<= ~a4~0 0) .cse15 .cse4) (and (not .cse9) .cse2 .cse26 .cse7)))) [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 23:51:42,025 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 23:51:42,026 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 23:51:42,027 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 23:51:42,027 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 23:51:42,027 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,027 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,027 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,027 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,027 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,027 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 23:51:42,027 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:51:42,028 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:51:42,029 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:51:42,030 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:51:42,030 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:51:42,030 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,030 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,030 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:51:42,030 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:51:42,030 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,031 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,032 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,033 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 23:51:42,034 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,035 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,036 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,037 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,037 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,037 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,037 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,037 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 23:51:42,037 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 23:51:42,037 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:51:42,037 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:51:42,037 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,038 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,039 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 23:51:42,040 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,041 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,042 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,043 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,043 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,043 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 23:51:42,043 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 23:51:42,043 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 23:51:42,043 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,043 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,043 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,044 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse25 (+ ~a23~0 43)) (.cse21 (< 277 ~a29~0)) (.cse18 (= 10 ~a25~0)) (.cse6 (<= ~a25~0 12)) (.cse17 (<= ~a29~0 130)) (.cse13 (= ~a25~0 11))) (let ((.cse10 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230)) (.cse8 (exists ((v_~a23~0_474 Int)) (let ((.cse27 (div v_~a23~0_474 5))) (and (= (mod v_~a23~0_474 5) 0) (<= ~a23~0 (+ (mod (* .cse27 4) 83) 180)) (<= 312 v_~a23~0_474) (<= 0 (* 4 .cse27)))))) (.cse5 (not .cse13)) (.cse0 (and .cse6 .cse17)) (.cse23 (<= 260 ~a29~0)) (.cse14 (< 138 ~a23~0)) (.cse24 (<= ~a29~0 275)) (.cse19 (<= 141 ~a29~0)) (.cse1 (<= ~a25~0 9)) (.cse11 (and .cse21 (not .cse18))) (.cse12 (<= ~a23~0 312)) (.cse16 (= ~a4~0 1)) (.cse3 (= ~a25~0 9)) (.cse22 (<= ~a29~0 245)) (.cse20 (= 12 ~a25~0)) (.cse15 (<= (+ ~a29~0 193245) 0)) (.cse4 (= 15 ~a8~0)) (.cse9 (= ~a25~0 13)) (.cse2 (= 1 ~a4~0)) (.cse26 (<= 130 ~a29~0)) (.cse7 (<= .cse25 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and (and .cse5 .cse6 .cse2) .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse2) (and .cse12 .cse4 .cse2 .cse13 .cse14) (and .cse5 (<= (+ (* 5 ~a29~0) ~a23~0) 1687) .cse15 .cse6 .cse4 .cse16) (and .cse9 .cse12 .cse4 (or .cse10 (<= ~a23~0 306))) (and .cse8 .cse9 .cse17 .cse2) (and .cse18 .cse4 .cse2 .cse14) (and (or (and .cse2 .cse13 .cse14 .cse19) (and .cse20 (< 140 ~a29~0) (<= ~a29~0 277) .cse2 .cse14)) .cse4) (and .cse3 (and .cse21 .cse7) .cse4) (and .cse12 .cse18 .cse4 .cse22) (and .cse17 .cse18 .cse4) (and .cse4 (and (and .cse12 .cse1 .cse2) .cse23)) (and (and .cse5 .cse12 .cse0 .cse2) .cse4) (and .cse18 .cse4 .cse7) (and (and (and .cse1 .cse24 .cse2) .cse23) .cse4) (and .cse12 .cse3 (< 0 .cse25) .cse4 .cse22) (and .cse12 .cse20 .cse4 .cse14) (and (and .cse9 (exists ((v_~a29~0_505 Int)) (and (<= v_~a29~0_505 140) (<= ~a29~0 (+ (div v_~a29~0_505 5) 206649)) (<= 0 v_~a29~0_505))) .cse2) .cse4) (and .cse4 (and (and (or .cse20 (and .cse2 .cse13)) .cse24) .cse19)) (and (or (and (or (and .cse18 .cse21) (and .cse11 .cse13)) .cse2) (and .cse1 .cse11 .cse2)) .cse4) (and .cse12 (and .cse20 (not .cse16)) .cse4) (and .cse7 .cse3 .cse15 .cse4) (and .cse4 .cse13 .cse7) (and .cse22 .cse2 .cse26 .cse7) (and .cse20 (<= ~a4~0 0) .cse15 .cse4) (and (not .cse9) .cse2 .cse26 .cse7)))) [2019-11-15 23:51:42,044 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,044 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:51:42,044 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:51:42,044 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,044 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,044 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 23:51:42,044 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,044 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,044 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:51:42,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:51:42 BoogieIcfgContainer [2019-11-15 23:51:42,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:51:42,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:51:42,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:51:42,099 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:51:42,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:19" (3/4) ... [2019-11-15 23:51:42,103 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:51:42,129 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:51:42,131 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:51:42,161 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a25 <= 12 && a29 <= 130) && a25 <= 9) && 1 == a4) || ((a25 == 9 && 15 == a8) && 1 == a4)) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 277 < a29 && !(10 == a25)) && 1 == a4)) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && a4 == 1)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || (((10 == a25 && 15 == a8) && 1 == a4) && 138 < a23)) || (((((1 == a4 && a25 == 11) && 138 < a23) && 141 <= a29) || ((((12 == a25 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23)) && 15 == a8)) || ((a25 == 9 && 277 < a29 && a23 + 43 <= 0) && 15 == a8)) || (((a23 <= 312 && 10 == a25) && 15 == a8) && a29 <= 245)) || ((a29 <= 130 && 10 == a25) && 15 == a8)) || (15 == a8 && ((a23 <= 312 && a25 <= 9) && 1 == a4) && 260 <= a29)) || ((((!(a25 == 11) && a23 <= 312) && a25 <= 12 && a29 <= 130) && 1 == a4) && 15 == a8)) || ((10 == a25 && 15 == a8) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 1 == a4) && 260 <= a29) && 15 == a8)) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((a23 <= 312 && 12 == a25) && 15 == a8) && 138 < a23)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 1 == a4) && 15 == a8)) || (15 == a8 && ((12 == a25 || (1 == a4 && a25 == 11)) && a29 <= 275) && 141 <= a29)) || (((((10 == a25 && 277 < a29) || ((277 < a29 && !(10 == a25)) && a25 == 11)) && 1 == a4) || ((a25 <= 9 && 277 < a29 && !(10 == a25)) && 1 == a4)) && 15 == a8)) || ((a23 <= 312 && 12 == a25 && !(a4 == 1)) && 15 == a8)) || (((a23 + 43 <= 0 && a25 == 9) && a29 + 193245 <= 0) && 15 == a8)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((12 == a25 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) [2019-11-15 23:51:42,164 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a25 <= 12 && a29 <= 130) && a25 <= 9) && 1 == a4) || ((a25 == 9 && 15 == a8) && 1 == a4)) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 277 < a29 && !(10 == a25)) && 1 == a4)) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && a4 == 1)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || (((10 == a25 && 15 == a8) && 1 == a4) && 138 < a23)) || (((((1 == a4 && a25 == 11) && 138 < a23) && 141 <= a29) || ((((12 == a25 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23)) && 15 == a8)) || ((a25 == 9 && 277 < a29 && a23 + 43 <= 0) && 15 == a8)) || (((a23 <= 312 && 10 == a25) && 15 == a8) && a29 <= 245)) || ((a29 <= 130 && 10 == a25) && 15 == a8)) || (15 == a8 && ((a23 <= 312 && a25 <= 9) && 1 == a4) && 260 <= a29)) || ((((!(a25 == 11) && a23 <= 312) && a25 <= 12 && a29 <= 130) && 1 == a4) && 15 == a8)) || ((10 == a25 && 15 == a8) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 1 == a4) && 260 <= a29) && 15 == a8)) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((a23 <= 312 && 12 == a25) && 15 == a8) && 138 < a23)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 1 == a4) && 15 == a8)) || (15 == a8 && ((12 == a25 || (1 == a4 && a25 == 11)) && a29 <= 275) && 141 <= a29)) || (((((10 == a25 && 277 < a29) || ((277 < a29 && !(10 == a25)) && a25 == 11)) && 1 == a4) || ((a25 <= 9 && 277 < a29 && !(10 == a25)) && 1 == a4)) && 15 == a8)) || ((a23 <= 312 && 12 == a25 && !(a4 == 1)) && 15 == a8)) || (((a23 + 43 <= 0 && a25 == 9) && a29 + 193245 <= 0) && 15 == a8)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((12 == a25 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) [2019-11-15 23:51:42,287 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_eeb99155-5f08-4f36-949c-6668a69b5499/bin/uautomizer/witness.graphml [2019-11-15 23:51:42,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:51:42,289 INFO L168 Benchmark]: Toolchain (without parser) took 85931.65 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 940.8 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:42,289 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:51:42,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 930.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:42,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.69 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:42,290 INFO L168 Benchmark]: Boogie Preprocessor took 139.95 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:42,291 INFO L168 Benchmark]: RCFGBuilder took 2043.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:42,291 INFO L168 Benchmark]: TraceAbstraction took 82486.37 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 881.2 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:51:42,291 INFO L168 Benchmark]: Witness Printer took 188.50 ms. Allocated memory is still 3.5 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:42,293 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.27 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 930.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.69 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.95 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2043.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 82486.37 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 881.2 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 188.50 ms. Allocated memory is still 3.5 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-15 23:51:42,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a25 <= 12 && a29 <= 130) && a25 <= 9) && 1 == a4) || ((a25 == 9 && 15 == a8) && 1 == a4)) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 277 < a29 && !(10 == a25)) && 1 == a4)) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && a4 == 1)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || (((10 == a25 && 15 == a8) && 1 == a4) && 138 < a23)) || (((((1 == a4 && a25 == 11) && 138 < a23) && 141 <= a29) || ((((12 == a25 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23)) && 15 == a8)) || ((a25 == 9 && 277 < a29 && a23 + 43 <= 0) && 15 == a8)) || (((a23 <= 312 && 10 == a25) && 15 == a8) && a29 <= 245)) || ((a29 <= 130 && 10 == a25) && 15 == a8)) || (15 == a8 && ((a23 <= 312 && a25 <= 9) && 1 == a4) && 260 <= a29)) || ((((!(a25 == 11) && a23 <= 312) && a25 <= 12 && a29 <= 130) && 1 == a4) && 15 == a8)) || ((10 == a25 && 15 == a8) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 1 == a4) && 260 <= a29) && 15 == a8)) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((a23 <= 312 && 12 == a25) && 15 == a8) && 138 < a23)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 1 == a4) && 15 == a8)) || (15 == a8 && ((12 == a25 || (1 == a4 && a25 == 11)) && a29 <= 275) && 141 <= a29)) || (((((10 == a25 && 277 < a29) || ((277 < a29 && !(10 == a25)) && a25 == 11)) && 1 == a4) || ((a25 <= 9 && 277 < a29 && !(10 == a25)) && 1 == a4)) && 15 == a8)) || ((a23 <= 312 && 12 == a25 && !(a4 == 1)) && 15 == a8)) || (((a23 + 43 <= 0 && a25 == 9) && a29 + 193245 <= 0) && 15 == a8)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((12 == a25 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 23:51:42,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:51:42,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:51:42,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a25 <= 12 && a29 <= 130) && a25 <= 9) && 1 == a4) || ((a25 == 9 && 15 == a8) && 1 == a4)) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 277 < a29 && !(10 == a25)) && 1 == a4)) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && a4 == 1)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || (((10 == a25 && 15 == a8) && 1 == a4) && 138 < a23)) || (((((1 == a4 && a25 == 11) && 138 < a23) && 141 <= a29) || ((((12 == a25 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23)) && 15 == a8)) || ((a25 == 9 && 277 < a29 && a23 + 43 <= 0) && 15 == a8)) || (((a23 <= 312 && 10 == a25) && 15 == a8) && a29 <= 245)) || ((a29 <= 130 && 10 == a25) && 15 == a8)) || (15 == a8 && ((a23 <= 312 && a25 <= 9) && 1 == a4) && 260 <= a29)) || ((((!(a25 == 11) && a23 <= 312) && a25 <= 12 && a29 <= 130) && 1 == a4) && 15 == a8)) || ((10 == a25 && 15 == a8) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 1 == a4) && 260 <= a29) && 15 == a8)) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((a23 <= 312 && 12 == a25) && 15 == a8) && 138 < a23)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 1 == a4) && 15 == a8)) || (15 == a8 && ((12 == a25 || (1 == a4 && a25 == 11)) && a29 <= 275) && 141 <= a29)) || (((((10 == a25 && 277 < a29) || ((277 < a29 && !(10 == a25)) && a25 == 11)) && 1 == a4) || ((a25 <= 9 && 277 < a29 && !(10 == a25)) && 1 == a4)) && 15 == a8)) || ((a23 <= 312 && 12 == a25 && !(a4 == 1)) && 15 == a8)) || (((a23 + 43 <= 0 && a25 == 9) && a29 + 193245 <= 0) && 15 == a8)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((12 == a25 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 82.3s, OverallIterations: 19, TraceHistogramMax: 9, AutomataDifference: 55.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.4s, HoareTripleCheckerStatistics: 2876 SDtfs, 12335 SDslu, 1413 SDs, 0 SdLazy, 44489 SolverSat, 4423 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 43.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2262 GetRequests, 2151 SyntacticMatches, 8 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22888occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 41117 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 182 NumberOfFragments, 1127 HoareAnnotationTreeSize, 3 FomulaSimplifications, 80934 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 52706 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 8979 NumberOfCodeBlocks, 8979 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 8954 ConstructedInterpolants, 297 QuantifiedInterpolants, 16796626 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2864 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 11655/12788 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...