./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label51.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_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label51.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/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 82f1252cdfefb15e293400630c3df24cee2c679c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:43:35,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:43:35,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:43:35,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:43:35,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:43:35,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:43:35,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:43:35,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:43:35,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:43:35,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:43:35,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:43:35,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:43:35,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:43:35,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:43:35,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:43:35,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:43:35,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:43:35,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:43:35,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:43:35,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:43:35,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:43:35,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:43:35,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:43:35,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:43:35,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:43:35,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:43:35,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:43:35,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:43:35,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:43:35,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:43:35,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:43:35,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:43:35,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:43:35,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:43:35,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:43:35,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:43:35,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:43:35,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:43:35,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:43:35,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:43:35,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:43:35,488 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:43:35,515 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:43:35,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:43:35,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:43:35,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:43:35,527 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:43:35,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:43:35,528 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:43:35,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:43:35,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:43:35,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:43:35,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:43:35,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:43:35,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:43:35,530 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:43:35,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:43:35,530 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:43:35,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:43:35,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:43:35,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:43:35,532 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:43:35,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:43:35,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:43:35,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:43:35,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:43:35,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:43:35,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:43:35,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:43:35,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:43:35,535 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_7ef79f22-4296-411b-bac9-8e2856f4889b/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 -> 82f1252cdfefb15e293400630c3df24cee2c679c [2019-11-15 20:43:35,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:43:35,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:43:35,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:43:35,588 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:43:35,588 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:43:35,590 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label51.c [2019-11-15 20:43:35,653 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/data/179d3ae21/980af58b8e984e41b4c28f0679e49980/FLAG20e4933eb [2019-11-15 20:43:36,126 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:43:36,126 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/sv-benchmarks/c/eca-rers2012/Problem14_label51.c [2019-11-15 20:43:36,138 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/data/179d3ae21/980af58b8e984e41b4c28f0679e49980/FLAG20e4933eb [2019-11-15 20:43:36,461 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/data/179d3ae21/980af58b8e984e41b4c28f0679e49980 [2019-11-15 20:43:36,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:43:36,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:43:36,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:43:36,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:43:36,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:43:36,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:43:36" (1/1) ... [2019-11-15 20:43:36,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327f337b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:36, skipping insertion in model container [2019-11-15 20:43:36,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:43:36" (1/1) ... [2019-11-15 20:43:36,480 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:43:36,547 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:43:36,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:43:37,002 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:43:37,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:43:37,236 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:43:37,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37 WrapperNode [2019-11-15 20:43:37,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:43:37,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:43:37,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:43:37,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:43:37,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... [2019-11-15 20:43:37,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... [2019-11-15 20:43:37,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:43:37,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:43:37,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:43:37,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:43:37,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... [2019-11-15 20:43:37,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... [2019-11-15 20:43:37,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... [2019-11-15 20:43:37,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... [2019-11-15 20:43:37,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... [2019-11-15 20:43:37,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... [2019-11-15 20:43:37,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... [2019-11-15 20:43:37,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:43:37,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:43:37,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:43:37,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:43:37,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/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 20:43:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:43:37,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:43:38,955 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:43:38,956 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:43:38,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:43:38 BoogieIcfgContainer [2019-11-15 20:43:38,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:43:38,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:43:38,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:43:38,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:43:38,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:43:36" (1/3) ... [2019-11-15 20:43:38,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ab6e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:43:38, skipping insertion in model container [2019-11-15 20:43:38,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:37" (2/3) ... [2019-11-15 20:43:38,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ab6e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:43:38, skipping insertion in model container [2019-11-15 20:43:38,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:43:38" (3/3) ... [2019-11-15 20:43:38,969 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label51.c [2019-11-15 20:43:38,978 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:43:38,986 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:43:38,996 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:43:39,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:43:39,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:43:39,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:43:39,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:43:39,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:43:39,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:43:39,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:43:39,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:43:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-15 20:43:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 20:43:39,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:39,070 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:39,072 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash -596708735, now seen corresponding path program 1 times [2019-11-15 20:43:39,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:39,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337819127] [2019-11-15 20:43:39,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:39,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:39,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:39,289 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 20:43:39,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337819127] [2019-11-15 20:43:39,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:39,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:43:39,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968130588] [2019-11-15 20:43:39,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:39,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:39,311 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-15 20:43:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:41,270 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-11-15 20:43:41,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:41,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 20:43:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:41,288 INFO L225 Difference]: With dead ends: 866 [2019-11-15 20:43:41,288 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 20:43:41,292 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 20:43:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 20:43:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-15 20:43:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-15 20:43:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 754 transitions. [2019-11-15 20:43:41,384 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 754 transitions. Word has length 35 [2019-11-15 20:43:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:41,385 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 754 transitions. [2019-11-15 20:43:41,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 754 transitions. [2019-11-15 20:43:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-15 20:43:41,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:41,398 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:43:41,399 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:41,400 INFO L82 PathProgramCache]: Analyzing trace with hash -545911462, now seen corresponding path program 1 times [2019-11-15 20:43:41,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:41,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587175501] [2019-11-15 20:43:41,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:41,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:41,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:43:41,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587175501] [2019-11-15 20:43:41,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:41,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:43:41,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067834142] [2019-11-15 20:43:41,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:43:41,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:41,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:43:41,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:41,946 INFO L87 Difference]: Start difference. First operand 538 states and 754 transitions. Second operand 6 states. [2019-11-15 20:43:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:43,957 INFO L93 Difference]: Finished difference Result 1964 states and 2764 transitions. [2019-11-15 20:43:43,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:43,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-11-15 20:43:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:43,965 INFO L225 Difference]: With dead ends: 1964 [2019-11-15 20:43:43,966 INFO L226 Difference]: Without dead ends: 1428 [2019-11-15 20:43:43,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:43:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-15 20:43:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2019-11-15 20:43:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-15 20:43:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1849 transitions. [2019-11-15 20:43:44,026 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1849 transitions. Word has length 143 [2019-11-15 20:43:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:44,027 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1849 transitions. [2019-11-15 20:43:44,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:43:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1849 transitions. [2019-11-15 20:43:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-15 20:43:44,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:44,039 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:43:44,040 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1795619338, now seen corresponding path program 1 times [2019-11-15 20:43:44,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:44,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795367536] [2019-11-15 20:43:44,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:44,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:44,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-15 20:43:44,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795367536] [2019-11-15 20:43:44,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:44,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:43:44,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570894819] [2019-11-15 20:43:44,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:44,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:44,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:44,150 INFO L87 Difference]: Start difference. First operand 1428 states and 1849 transitions. Second operand 4 states. [2019-11-15 20:43:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:45,247 INFO L93 Difference]: Finished difference Result 3922 states and 5314 transitions. [2019-11-15 20:43:45,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:45,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-15 20:43:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:45,263 INFO L225 Difference]: With dead ends: 3922 [2019-11-15 20:43:45,264 INFO L226 Difference]: Without dead ends: 2674 [2019-11-15 20:43:45,266 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 20:43:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-15 20:43:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-11-15 20:43:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 20:43:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2951 transitions. [2019-11-15 20:43:45,333 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2951 transitions. Word has length 209 [2019-11-15 20:43:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:45,333 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2951 transitions. [2019-11-15 20:43:45,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2951 transitions. [2019-11-15 20:43:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-15 20:43:45,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:45,341 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:43:45,342 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash -853230355, now seen corresponding path program 1 times [2019-11-15 20:43:45,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:45,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630925324] [2019-11-15 20:43:45,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:45,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:45,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 136 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 20:43:45,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630925324] [2019-11-15 20:43:45,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190133964] [2019-11-15 20:43:45,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/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 20:43:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:45,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:43:45,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-15 20:43:45,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:43:45,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:43:45,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639350955] [2019-11-15 20:43:45,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:43:45,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:43:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:45,891 INFO L87 Difference]: Start difference. First operand 2318 states and 2951 transitions. Second operand 3 states. [2019-11-15 20:43:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:46,627 INFO L93 Difference]: Finished difference Result 4456 states and 5716 transitions. [2019-11-15 20:43:46,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:43:46,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-15 20:43:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:46,646 INFO L225 Difference]: With dead ends: 4456 [2019-11-15 20:43:46,647 INFO L226 Difference]: Without dead ends: 2318 [2019-11-15 20:43:46,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-11-15 20:43:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2019-11-15 20:43:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 20:43:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2817 transitions. [2019-11-15 20:43:46,700 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2817 transitions. Word has length 223 [2019-11-15 20:43:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:46,702 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2817 transitions. [2019-11-15 20:43:46,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:43:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2817 transitions. [2019-11-15 20:43:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-15 20:43:46,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:46,708 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:46,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:46,927 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash -993849494, now seen corresponding path program 1 times [2019-11-15 20:43:46,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:46,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274479097] [2019-11-15 20:43:46,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:46,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:46,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 20:43:47,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274479097] [2019-11-15 20:43:47,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432570238] [2019-11-15 20:43:47,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/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 20:43:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:47,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:43:47,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-15 20:43:47,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:43:47,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:43:47,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459734407] [2019-11-15 20:43:47,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:43:47,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:43:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:47,432 INFO L87 Difference]: Start difference. First operand 2318 states and 2817 transitions. Second operand 3 states. [2019-11-15 20:43:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:48,130 INFO L93 Difference]: Finished difference Result 5880 states and 7234 transitions. [2019-11-15 20:43:48,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:43:48,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-15 20:43:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:48,148 INFO L225 Difference]: With dead ends: 5880 [2019-11-15 20:43:48,148 INFO L226 Difference]: Without dead ends: 3742 [2019-11-15 20:43:48,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-15 20:43:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2019-11-15 20:43:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-15 20:43:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4207 transitions. [2019-11-15 20:43:48,216 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4207 transitions. Word has length 292 [2019-11-15 20:43:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:48,217 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 4207 transitions. [2019-11-15 20:43:48,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:43:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4207 transitions. [2019-11-15 20:43:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-15 20:43:48,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:48,223 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:48,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:48,427 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:48,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1870613307, now seen corresponding path program 1 times [2019-11-15 20:43:48,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:48,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40024657] [2019-11-15 20:43:48,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:48,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:48,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 244 proven. 4 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-15 20:43:48,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40024657] [2019-11-15 20:43:48,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525994239] [2019-11-15 20:43:48,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/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 20:43:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:48,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:43:48,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 20:43:48,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:43:48,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:43:48,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988529877] [2019-11-15 20:43:48,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:43:48,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:48,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:43:48,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:48,893 INFO L87 Difference]: Start difference. First operand 3564 states and 4207 transitions. Second operand 3 states. [2019-11-15 20:43:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:49,616 INFO L93 Difference]: Finished difference Result 7838 states and 9371 transitions. [2019-11-15 20:43:49,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:43:49,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-15 20:43:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:49,634 INFO L225 Difference]: With dead ends: 7838 [2019-11-15 20:43:49,634 INFO L226 Difference]: Without dead ends: 4454 [2019-11-15 20:43:49,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-11-15 20:43:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2019-11-15 20:43:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-15 20:43:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 5193 transitions. [2019-11-15 20:43:49,712 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 5193 transitions. Word has length 305 [2019-11-15 20:43:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:49,713 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 5193 transitions. [2019-11-15 20:43:49,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:43:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 5193 transitions. [2019-11-15 20:43:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-15 20:43:49,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:49,720 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 20:43:49,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:49,924 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash 438066137, now seen corresponding path program 1 times [2019-11-15 20:43:49,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:49,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641485589] [2019-11-15 20:43:49,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:49,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:49,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 244 proven. 4 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-15 20:43:50,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641485589] [2019-11-15 20:43:50,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066891967] [2019-11-15 20:43:50,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/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 20:43:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:50,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:43:50,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-15 20:43:50,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:43:50,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:43:50,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961484848] [2019-11-15 20:43:50,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:43:50,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:50,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:43:50,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:50,381 INFO L87 Difference]: Start difference. First operand 4454 states and 5193 transitions. Second operand 3 states. [2019-11-15 20:43:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:50,975 INFO L93 Difference]: Finished difference Result 9974 states and 11706 transitions. [2019-11-15 20:43:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:43:50,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-11-15 20:43:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:50,992 INFO L225 Difference]: With dead ends: 9974 [2019-11-15 20:43:50,992 INFO L226 Difference]: Without dead ends: 4988 [2019-11-15 20:43:50,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-15 20:43:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 3920. [2019-11-15 20:43:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-15 20:43:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4561 transitions. [2019-11-15 20:43:51,066 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4561 transitions. Word has length 313 [2019-11-15 20:43:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:51,067 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4561 transitions. [2019-11-15 20:43:51,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:43:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4561 transitions. [2019-11-15 20:43:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-15 20:43:51,074 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:51,075 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:51,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:51,278 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1982666170, now seen corresponding path program 1 times [2019-11-15 20:43:51,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:51,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766151279] [2019-11-15 20:43:51,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:51,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:51,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 244 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 20:43:51,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766151279] [2019-11-15 20:43:51,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210850144] [2019-11-15 20:43:51,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/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 20:43:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:51,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:43:51,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 20:43:51,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:43:51,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 20:43:51,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911849485] [2019-11-15 20:43:51,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:51,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:51,877 INFO L87 Difference]: Start difference. First operand 3920 states and 4561 transitions. Second operand 4 states. [2019-11-15 20:43:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:52,567 INFO L93 Difference]: Finished difference Result 7689 states and 8958 transitions. [2019-11-15 20:43:52,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:52,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-11-15 20:43:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:52,581 INFO L225 Difference]: With dead ends: 7689 [2019-11-15 20:43:52,581 INFO L226 Difference]: Without dead ends: 4098 [2019-11-15 20:43:52,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-11-15 20:43:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2019-11-15 20:43:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-15 20:43:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4186 transitions. [2019-11-15 20:43:52,638 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4186 transitions. Word has length 324 [2019-11-15 20:43:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:52,638 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4186 transitions. [2019-11-15 20:43:52,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4186 transitions. [2019-11-15 20:43:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-15 20:43:52,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:52,644 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:52,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:52,847 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:52,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1057538892, now seen corresponding path program 1 times [2019-11-15 20:43:52,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:52,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294777803] [2019-11-15 20:43:52,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:52,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:52,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 411 proven. 65 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-15 20:43:53,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294777803] [2019-11-15 20:43:53,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269460323] [2019-11-15 20:43:53,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/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 20:43:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:53,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:43:53,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-15 20:43:54,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:43:54,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-15 20:43:54,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21204919] [2019-11-15 20:43:54,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:43:54,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:54,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:43:54,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:43:54,054 INFO L87 Difference]: Start difference. First operand 3920 states and 4186 transitions. Second operand 7 states. [2019-11-15 20:43:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:54,848 INFO L93 Difference]: Finished difference Result 7710 states and 8241 transitions. [2019-11-15 20:43:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:43:54,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 419 [2019-11-15 20:43:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:54,863 INFO L225 Difference]: With dead ends: 7710 [2019-11-15 20:43:54,864 INFO L226 Difference]: Without dead ends: 4098 [2019-11-15 20:43:54,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 414 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:43:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-11-15 20:43:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2019-11-15 20:43:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-15 20:43:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4116 transitions. [2019-11-15 20:43:54,918 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4116 transitions. Word has length 419 [2019-11-15 20:43:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:54,919 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4116 transitions. [2019-11-15 20:43:54,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:43:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4116 transitions. [2019-11-15 20:43:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2019-11-15 20:43:54,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:54,927 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 20:43:55,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:55,130 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 798665016, now seen corresponding path program 1 times [2019-11-15 20:43:55,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:55,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78375205] [2019-11-15 20:43:55,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:55,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:55,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 1190 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-11-15 20:43:55,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78375205] [2019-11-15 20:43:55,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:55,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:55,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771394611] [2019-11-15 20:43:55,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:55,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:55,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:55,791 INFO L87 Difference]: Start difference. First operand 3920 states and 4116 transitions. Second operand 4 states. [2019-11-15 20:43:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:56,590 INFO L93 Difference]: Finished difference Result 8906 states and 9424 transitions. [2019-11-15 20:43:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:56,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 749 [2019-11-15 20:43:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:56,607 INFO L225 Difference]: With dead ends: 8906 [2019-11-15 20:43:56,612 INFO L226 Difference]: Without dead ends: 5166 [2019-11-15 20:43:56,616 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 20:43:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-15 20:43:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2019-11-15 20:43:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-15 20:43:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5242 transitions. [2019-11-15 20:43:56,680 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5242 transitions. Word has length 749 [2019-11-15 20:43:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:56,681 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5242 transitions. [2019-11-15 20:43:56,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5242 transitions. [2019-11-15 20:43:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2019-11-15 20:43:56,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:56,693 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:56,694 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:56,694 INFO L82 PathProgramCache]: Analyzing trace with hash 738870712, now seen corresponding path program 1 times [2019-11-15 20:43:56,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:56,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143246414] [2019-11-15 20:43:56,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:56,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:56,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 989 proven. 4 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-11-15 20:43:57,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143246414] [2019-11-15 20:43:57,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370541773] [2019-11-15 20:43:57,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:58,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:43:58,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2019-11-15 20:43:58,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:43:58,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 20:43:58,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660609123] [2019-11-15 20:43:58,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:43:58,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:58,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:43:58,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:43:58,543 INFO L87 Difference]: Start difference. First operand 4988 states and 5242 transitions. Second operand 3 states. [2019-11-15 20:43:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:59,118 INFO L93 Difference]: Finished difference Result 9796 states and 10306 transitions. [2019-11-15 20:43:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:43:59,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 797 [2019-11-15 20:43:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:59,128 INFO L225 Difference]: With dead ends: 9796 [2019-11-15 20:43:59,128 INFO L226 Difference]: Without dead ends: 5166 [2019-11-15 20:43:59,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:43:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-15 20:43:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2019-11-15 20:43:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-15 20:43:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5033 transitions. [2019-11-15 20:43:59,190 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5033 transitions. Word has length 797 [2019-11-15 20:43:59,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:59,191 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 5033 transitions. [2019-11-15 20:43:59,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:43:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5033 transitions. [2019-11-15 20:43:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2019-11-15 20:43:59,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:59,202 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:59,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:59,408 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1407042162, now seen corresponding path program 1 times [2019-11-15 20:43:59,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:59,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113725806] [2019-11-15 20:43:59,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:59,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:59,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 1011 proven. 4 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-15 20:44:00,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113725806] [2019-11-15 20:44:00,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689068890] [2019-11-15 20:44:00,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:00,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:44:00,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:00,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 992 proven. 23 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-15 20:44:01,541 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:44:01,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 20:44:01,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599954292] [2019-11-15 20:44:01,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:44:01,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:44:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:44:01,544 INFO L87 Difference]: Start difference. First operand 4810 states and 5033 transitions. Second operand 8 states. [2019-11-15 20:44:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:03,238 INFO L93 Difference]: Finished difference Result 9687 states and 10140 transitions. [2019-11-15 20:44:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:44:03,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 820 [2019-11-15 20:44:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:03,247 INFO L225 Difference]: With dead ends: 9687 [2019-11-15 20:44:03,248 INFO L226 Difference]: Without dead ends: 5235 [2019-11-15 20:44:03,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 817 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:44:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2019-11-15 20:44:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 4632. [2019-11-15 20:44:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 20:44:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4853 transitions. [2019-11-15 20:44:03,316 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4853 transitions. Word has length 820 [2019-11-15 20:44:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:03,316 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4853 transitions. [2019-11-15 20:44:03,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:44:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4853 transitions. [2019-11-15 20:44:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2019-11-15 20:44:03,327 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:03,328 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:03,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:03,533 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:03,534 INFO L82 PathProgramCache]: Analyzing trace with hash 980114751, now seen corresponding path program 1 times [2019-11-15 20:44:03,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:03,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65525142] [2019-11-15 20:44:03,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:03,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:03,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2377 backedges. 1690 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-11-15 20:44:05,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65525142] [2019-11-15 20:44:05,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:05,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:44:05,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179978746] [2019-11-15 20:44:05,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:44:05,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:44:05,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:05,532 INFO L87 Difference]: Start difference. First operand 4632 states and 4853 transitions. Second operand 7 states. [2019-11-15 20:44:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:06,601 INFO L93 Difference]: Finished difference Result 9621 states and 10071 transitions. [2019-11-15 20:44:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:44:06,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 909 [2019-11-15 20:44:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:06,609 INFO L225 Difference]: With dead ends: 9621 [2019-11-15 20:44:06,609 INFO L226 Difference]: Without dead ends: 4991 [2019-11-15 20:44:06,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:44:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2019-11-15 20:44:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4632. [2019-11-15 20:44:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 20:44:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4850 transitions. [2019-11-15 20:44:06,671 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4850 transitions. Word has length 909 [2019-11-15 20:44:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:06,672 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4850 transitions. [2019-11-15 20:44:06,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:44:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4850 transitions. [2019-11-15 20:44:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2019-11-15 20:44:06,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:06,684 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:06,684 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:06,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:06,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2037086168, now seen corresponding path program 1 times [2019-11-15 20:44:06,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:06,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552887842] [2019-11-15 20:44:06,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:06,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:06,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 738 proven. 257 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-15 20:44:08,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552887842] [2019-11-15 20:44:08,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195727499] [2019-11-15 20:44:08,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:08,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:44:08,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:08,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:08,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 985 proven. 10 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-15 20:44:09,769 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:44:09,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-15 20:44:09,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526375018] [2019-11-15 20:44:09,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 20:44:09,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 20:44:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:44:09,772 INFO L87 Difference]: Start difference. First operand 4632 states and 4850 transitions. Second operand 13 states. [2019-11-15 20:44:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:11,055 INFO L93 Difference]: Finished difference Result 9506 states and 9947 transitions. [2019-11-15 20:44:11,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:44:11,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 986 [2019-11-15 20:44:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:11,064 INFO L225 Difference]: With dead ends: 9506 [2019-11-15 20:44:11,064 INFO L226 Difference]: Without dead ends: 4876 [2019-11-15 20:44:11,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 982 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:44:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4876 states. [2019-11-15 20:44:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4876 to 4632. [2019-11-15 20:44:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 20:44:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4820 transitions. [2019-11-15 20:44:11,126 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4820 transitions. Word has length 986 [2019-11-15 20:44:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:11,127 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4820 transitions. [2019-11-15 20:44:11,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 20:44:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4820 transitions. [2019-11-15 20:44:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-11-15 20:44:11,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:11,139 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:11,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:11,343 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash 538441961, now seen corresponding path program 1 times [2019-11-15 20:44:11,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:11,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963977415] [2019-11-15 20:44:11,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:11,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:11,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2376 proven. 140 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2019-11-15 20:44:12,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963977415] [2019-11-15 20:44:12,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221577755] [2019-11-15 20:44:12,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:12,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:44:12,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:12,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:12,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:12,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:12,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2453 proven. 616 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2019-11-15 20:44:13,600 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:44:13,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 20:44:13,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842740899] [2019-11-15 20:44:13,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:44:13,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:13,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:44:13,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:13,603 INFO L87 Difference]: Start difference. First operand 4632 states and 4820 transitions. Second operand 7 states. [2019-11-15 20:44:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:15,420 INFO L93 Difference]: Finished difference Result 11220 states and 11687 transitions. [2019-11-15 20:44:15,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:44:15,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1032 [2019-11-15 20:44:15,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:15,430 INFO L225 Difference]: With dead ends: 11220 [2019-11-15 20:44:15,430 INFO L226 Difference]: Without dead ends: 6412 [2019-11-15 20:44:15,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 1033 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:44:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-15 20:44:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6056. [2019-11-15 20:44:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-15 20:44:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6262 transitions. [2019-11-15 20:44:15,524 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6262 transitions. Word has length 1032 [2019-11-15 20:44:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:15,526 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6262 transitions. [2019-11-15 20:44:15,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:44:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6262 transitions. [2019-11-15 20:44:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1601 [2019-11-15 20:44:15,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:15,560 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:15,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:15,768 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash -160688465, now seen corresponding path program 1 times [2019-11-15 20:44:15,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:15,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512481345] [2019-11-15 20:44:15,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:15,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:15,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8277 backedges. 2606 proven. 0 refuted. 0 times theorem prover too weak. 5671 trivial. 0 not checked. [2019-11-15 20:44:18,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512481345] [2019-11-15 20:44:18,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:18,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:44:18,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466772063] [2019-11-15 20:44:18,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:44:18,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:18,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:44:18,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:18,485 INFO L87 Difference]: Start difference. First operand 6056 states and 6262 transitions. Second operand 7 states. [2019-11-15 20:44:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:19,097 INFO L93 Difference]: Finished difference Result 11696 states and 12089 transitions. [2019-11-15 20:44:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:44:19,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1600 [2019-11-15 20:44:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:19,102 INFO L225 Difference]: With dead ends: 11696 [2019-11-15 20:44:19,103 INFO L226 Difference]: Without dead ends: 5700 [2019-11-15 20:44:19,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2019-11-15 20:44:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5522. [2019-11-15 20:44:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-15 20:44:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5696 transitions. [2019-11-15 20:44:19,170 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5696 transitions. Word has length 1600 [2019-11-15 20:44:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:19,171 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5696 transitions. [2019-11-15 20:44:19,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:44:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5696 transitions. [2019-11-15 20:44:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2019-11-15 20:44:19,193 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:19,194 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:19,194 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:19,195 INFO L82 PathProgramCache]: Analyzing trace with hash -172671030, now seen corresponding path program 1 times [2019-11-15 20:44:19,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:19,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285835043] [2019-11-15 20:44:19,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:19,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:19,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8542 backedges. 4898 proven. 29 refuted. 0 times theorem prover too weak. 3615 trivial. 0 not checked. [2019-11-15 20:44:21,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285835043] [2019-11-15 20:44:21,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132533126] [2019-11-15 20:44:21,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:21,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 1982 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:44:21,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:22,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:22,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8542 backedges. 5716 proven. 514 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2019-11-15 20:44:26,171 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:44:26,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-11-15 20:44:26,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746916404] [2019-11-15 20:44:26,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:44:26,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:26,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:44:26,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:44:26,175 INFO L87 Difference]: Start difference. First operand 5522 states and 5696 transitions. Second operand 14 states. [2019-11-15 20:44:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:30,955 INFO L93 Difference]: Finished difference Result 13890 states and 14375 transitions. [2019-11-15 20:44:30,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:44:30,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1646 [2019-11-15 20:44:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:30,962 INFO L225 Difference]: With dead ends: 13890 [2019-11-15 20:44:30,962 INFO L226 Difference]: Without dead ends: 7836 [2019-11-15 20:44:30,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1672 GetRequests, 1649 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-11-15 20:44:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2019-11-15 20:44:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 4098. [2019-11-15 20:44:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-15 20:44:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4187 transitions. [2019-11-15 20:44:31,015 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4187 transitions. Word has length 1646 [2019-11-15 20:44:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:31,016 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4187 transitions. [2019-11-15 20:44:31,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:44:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4187 transitions. [2019-11-15 20:44:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1668 [2019-11-15 20:44:31,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:31,031 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:31,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:31,232 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:31,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:31,232 INFO L82 PathProgramCache]: Analyzing trace with hash -191271911, now seen corresponding path program 1 times [2019-11-15 20:44:31,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:31,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094704225] [2019-11-15 20:44:31,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:31,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:31,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8520 backedges. 2627 proven. 0 refuted. 0 times theorem prover too weak. 5893 trivial. 0 not checked. [2019-11-15 20:44:34,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094704225] [2019-11-15 20:44:34,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:34,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:44:34,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082092675] [2019-11-15 20:44:34,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:44:34,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:44:34,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:34,438 INFO L87 Difference]: Start difference. First operand 4098 states and 4187 transitions. Second operand 7 states. [2019-11-15 20:44:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:35,321 INFO L93 Difference]: Finished difference Result 8254 states and 8436 transitions. [2019-11-15 20:44:35,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:44:35,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1667 [2019-11-15 20:44:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:35,325 INFO L225 Difference]: With dead ends: 8254 [2019-11-15 20:44:35,325 INFO L226 Difference]: Without dead ends: 4276 [2019-11-15 20:44:35,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-15 20:44:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2019-11-15 20:44:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-15 20:44:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4186 transitions. [2019-11-15 20:44:35,368 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4186 transitions. Word has length 1667 [2019-11-15 20:44:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:35,369 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4186 transitions. [2019-11-15 20:44:35,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:44:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4186 transitions. [2019-11-15 20:44:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1814 [2019-11-15 20:44:35,399 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:35,400 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:35,400 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:35,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:35,400 INFO L82 PathProgramCache]: Analyzing trace with hash -354861792, now seen corresponding path program 1 times [2019-11-15 20:44:35,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:35,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848164756] [2019-11-15 20:44:35,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:35,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:35,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10875 backedges. 2724 proven. 0 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2019-11-15 20:44:37,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848164756] [2019-11-15 20:44:37,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:37,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:44:37,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711922330] [2019-11-15 20:44:37,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:44:37,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:37,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:44:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:44:37,830 INFO L87 Difference]: Start difference. First operand 4098 states and 4186 transitions. Second operand 5 states. [2019-11-15 20:44:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:38,872 INFO L93 Difference]: Finished difference Result 10508 states and 10764 transitions. [2019-11-15 20:44:38,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:44:38,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1813 [2019-11-15 20:44:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:38,878 INFO L225 Difference]: With dead ends: 10508 [2019-11-15 20:44:38,878 INFO L226 Difference]: Without dead ends: 6590 [2019-11-15 20:44:38,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:44:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2019-11-15 20:44:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 5344. [2019-11-15 20:44:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-15 20:44:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5485 transitions. [2019-11-15 20:44:38,933 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5485 transitions. Word has length 1813 [2019-11-15 20:44:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:38,934 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5485 transitions. [2019-11-15 20:44:38,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:44:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5485 transitions. [2019-11-15 20:44:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1949 [2019-11-15 20:44:38,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:38,954 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:38,955 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:38,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash -962862479, now seen corresponding path program 1 times [2019-11-15 20:44:38,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:38,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726151858] [2019-11-15 20:44:38,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:38,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:38,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12570 backedges. 4213 proven. 0 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2019-11-15 20:44:42,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726151858] [2019-11-15 20:44:42,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:42,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:44:42,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157928513] [2019-11-15 20:44:42,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:44:42,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:42,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:44:42,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:42,721 INFO L87 Difference]: Start difference. First operand 5344 states and 5485 transitions. Second operand 7 states. [2019-11-15 20:44:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:43,433 INFO L93 Difference]: Finished difference Result 10122 states and 10373 transitions. [2019-11-15 20:44:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:44:43,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1948 [2019-11-15 20:44:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:43,437 INFO L225 Difference]: With dead ends: 10122 [2019-11-15 20:44:43,438 INFO L226 Difference]: Without dead ends: 4665 [2019-11-15 20:44:43,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-11-15 20:44:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4487. [2019-11-15 20:44:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-15 20:44:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4585 transitions. [2019-11-15 20:44:43,476 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4585 transitions. Word has length 1948 [2019-11-15 20:44:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:43,477 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4585 transitions. [2019-11-15 20:44:43,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:44:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4585 transitions. [2019-11-15 20:44:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1957 [2019-11-15 20:44:43,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:43,498 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:43,498 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1012455035, now seen corresponding path program 1 times [2019-11-15 20:44:43,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:43,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136923959] [2019-11-15 20:44:43,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:43,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:43,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4245 proven. 0 refuted. 0 times theorem prover too weak. 8355 trivial. 0 not checked. [2019-11-15 20:44:47,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136923959] [2019-11-15 20:44:47,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:47,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:44:47,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210289329] [2019-11-15 20:44:47,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:44:47,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:47,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:44:47,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:47,315 INFO L87 Difference]: Start difference. First operand 4487 states and 4585 transitions. Second operand 7 states. [2019-11-15 20:44:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:47,898 INFO L93 Difference]: Finished difference Result 9203 states and 9404 transitions. [2019-11-15 20:44:47,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:44:47,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1956 [2019-11-15 20:44:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:47,902 INFO L225 Difference]: With dead ends: 9203 [2019-11-15 20:44:47,902 INFO L226 Difference]: Without dead ends: 4665 [2019-11-15 20:44:47,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-11-15 20:44:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4487. [2019-11-15 20:44:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-15 20:44:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4580 transitions. [2019-11-15 20:44:47,939 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4580 transitions. Word has length 1956 [2019-11-15 20:44:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:47,940 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4580 transitions. [2019-11-15 20:44:47,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:44:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4580 transitions. [2019-11-15 20:44:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1984 [2019-11-15 20:44:47,959 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:47,960 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:47,960 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -375981036, now seen corresponding path program 1 times [2019-11-15 20:44:47,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:47,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847804920] [2019-11-15 20:44:47,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:47,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:47,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12681 backedges. 4237 proven. 0 refuted. 0 times theorem prover too weak. 8444 trivial. 0 not checked. [2019-11-15 20:44:51,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847804920] [2019-11-15 20:44:51,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:51,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:44:51,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636720589] [2019-11-15 20:44:51,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:44:51,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:44:51,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:51,784 INFO L87 Difference]: Start difference. First operand 4487 states and 4580 transitions. Second operand 7 states. [2019-11-15 20:44:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:52,308 INFO L93 Difference]: Finished difference Result 9199 states and 9390 transitions. [2019-11-15 20:44:52,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:44:52,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1983 [2019-11-15 20:44:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:52,313 INFO L225 Difference]: With dead ends: 9199 [2019-11-15 20:44:52,313 INFO L226 Difference]: Without dead ends: 4665 [2019-11-15 20:44:52,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-11-15 20:44:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4487. [2019-11-15 20:44:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-15 20:44:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4575 transitions. [2019-11-15 20:44:52,360 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4575 transitions. Word has length 1983 [2019-11-15 20:44:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:52,362 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4575 transitions. [2019-11-15 20:44:52,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:44:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4575 transitions. [2019-11-15 20:44:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2015 [2019-11-15 20:44:52,383 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:52,384 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:52,384 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash 891606446, now seen corresponding path program 1 times [2019-11-15 20:44:52,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:52,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431989166] [2019-11-15 20:44:52,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:52,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:52,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13756 backedges. 9202 proven. 695 refuted. 0 times theorem prover too weak. 3859 trivial. 0 not checked. [2019-11-15 20:44:58,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431989166] [2019-11-15 20:44:58,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162587717] [2019-11-15 20:44:58,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:58,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 2438 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:44:58,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:58,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13756 backedges. 9287 proven. 184 refuted. 0 times theorem prover too weak. 4285 trivial. 0 not checked. [2019-11-15 20:45:03,178 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:03,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-11-15 20:45:03,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6514302] [2019-11-15 20:45:03,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:45:03,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:03,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:45:03,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:45:03,181 INFO L87 Difference]: Start difference. First operand 4487 states and 4575 transitions. Second operand 9 states. [2019-11-15 20:45:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:04,803 INFO L93 Difference]: Finished difference Result 9403 states and 9585 transitions. [2019-11-15 20:45:04,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:45:04,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2014 [2019-11-15 20:45:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:04,808 INFO L225 Difference]: With dead ends: 9403 [2019-11-15 20:45:04,808 INFO L226 Difference]: Without dead ends: 4918 [2019-11-15 20:45:04,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2025 GetRequests, 2012 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:45:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4918 states. [2019-11-15 20:45:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4918 to 4487. [2019-11-15 20:45:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-15 20:45:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4561 transitions. [2019-11-15 20:45:04,847 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4561 transitions. Word has length 2014 [2019-11-15 20:45:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:04,848 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4561 transitions. [2019-11-15 20:45:04,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:45:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4561 transitions. [2019-11-15 20:45:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2027 [2019-11-15 20:45:04,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:04,870 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:05,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:05,071 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:05,071 INFO L82 PathProgramCache]: Analyzing trace with hash -680935796, now seen corresponding path program 1 times [2019-11-15 20:45:05,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:05,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814889038] [2019-11-15 20:45:05,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:05,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:05,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13914 backedges. 4419 proven. 0 refuted. 0 times theorem prover too weak. 9495 trivial. 0 not checked. [2019-11-15 20:45:08,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814889038] [2019-11-15 20:45:08,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:08,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:08,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451686017] [2019-11-15 20:45:08,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:08,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:08,723 INFO L87 Difference]: Start difference. First operand 4487 states and 4561 transitions. Second operand 4 states. [2019-11-15 20:45:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:09,183 INFO L93 Difference]: Finished difference Result 9162 states and 9315 transitions. [2019-11-15 20:45:09,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:09,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2026 [2019-11-15 20:45:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:09,187 INFO L225 Difference]: With dead ends: 9162 [2019-11-15 20:45:09,187 INFO L226 Difference]: Without dead ends: 4665 [2019-11-15 20:45:09,189 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 20:45:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-11-15 20:45:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4487. [2019-11-15 20:45:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-15 20:45:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4559 transitions. [2019-11-15 20:45:09,235 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4559 transitions. Word has length 2026 [2019-11-15 20:45:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:09,236 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4559 transitions. [2019-11-15 20:45:09,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4559 transitions. [2019-11-15 20:45:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2116 [2019-11-15 20:45:09,259 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:09,260 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:09,261 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 58677289, now seen corresponding path program 1 times [2019-11-15 20:45:09,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:09,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814531623] [2019-11-15 20:45:09,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:09,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:09,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14461 backedges. 3142 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2019-11-15 20:45:12,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814531623] [2019-11-15 20:45:12,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:12,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:12,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848171900] [2019-11-15 20:45:12,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:12,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:12,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:12,101 INFO L87 Difference]: Start difference. First operand 4487 states and 4559 transitions. Second operand 5 states. [2019-11-15 20:45:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:12,670 INFO L93 Difference]: Finished difference Result 5021 states and 5097 transitions. [2019-11-15 20:45:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:12,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2115 [2019-11-15 20:45:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:12,671 INFO L225 Difference]: With dead ends: 5021 [2019-11-15 20:45:12,672 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:45:12,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:45:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:45:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:45:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:45:12,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2115 [2019-11-15 20:45:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:12,674 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:45:12,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:45:12,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:45:12,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:45:13,464 WARN L191 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 471 DAG size of output: 372 [2019-11-15 20:45:14,123 WARN L191 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 471 DAG size of output: 372 [2019-11-15 20:45:16,779 WARN L191 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 351 DAG size of output: 130 [2019-11-15 20:45:19,365 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 351 DAG size of output: 130 [2019-11-15 20:45:19,367 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-15 20:45:19,367 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-15 20:45:19,367 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,367 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-15 20:45:19,368 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-15 20:45:19,369 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,370 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 20:45:19,371 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 20:45:19,372 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-15 20:45:19,372 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-15 20:45:19,372 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-15 20:45:19,372 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-15 20:45:19,372 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,372 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,372 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,372 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 20:45:19,372 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 20:45:19,373 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 20:45:19,373 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-15 20:45:19,373 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-15 20:45:19,373 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-15 20:45:19,373 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-15 20:45:19,373 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-15 20:45:19,373 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,374 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,374 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,374 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-15 20:45:19,374 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-15 20:45:19,374 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:45:19,374 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 20:45:19,374 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 20:45:19,374 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 20:45:19,375 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-15 20:45:19,375 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-15 20:45:19,375 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-15 20:45:19,375 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,375 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,375 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,375 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-15 20:45:19,376 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-15 20:45:19,377 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-15 20:45:19,378 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,379 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,380 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse26 (<= ~a12~0 11)) (.cse12 (<= 10 ~a21~0)) (.cse2 (= ~a24~0 1)) (.cse14 (<= ~a15~0 8)) (.cse23 (= ~a21~0 9))) (let ((.cse4 (= ~a21~0 6)) (.cse0 (not .cse23)) (.cse21 (and .cse12 .cse2 .cse14)) (.cse13 (<= (+ ~a12~0 42) 0)) (.cse20 (= ~a21~0 8)) (.cse6 (= ~a15~0 5)) (.cse15 (<= ~a12~0 75)) (.cse10 (<= 20 ~a12~0)) (.cse19 (= ~a15~0 7)) (.cse27 (= ~a21~0 10)) (.cse5 (= ~a15~0 6)) (.cse24 (<= ~a21~0 6)) (.cse25 (< 0 (+ ~a12~0 43))) (.cse3 (< 80 ~a12~0)) (.cse22 (<= ~a12~0 599999)) (.cse11 (and .cse26 .cse14)) (.cse8 (= ~a21~0 7)) (.cse1 (= 8 ~a15~0)) (.cse16 (= 8 ~a21~0)) (.cse17 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse28 (<= 0 (+ ~a12~0 41))) (.cse18 (= 9 ~a15~0)) (.cse9 (<= ~a12~0 80)) (.cse7 (<= ~a15~0 6))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~a12~0 73281)) (and .cse4 .cse2 .cse5) (and .cse4 .cse2 .cse6) (and .cse7 .cse8) (and (or (and .cse9 .cse0 .cse10 .cse1) (and .cse11 .cse12 .cse1)) .cse2) (and .cse13 .cse2 (and .cse8 .cse14)) (and (and (and .cse15 .cse16 .cse17 (<= 19 ~a12~0)) .cse18) .cse2) (and .cse19 .cse2 .cse3 .cse20) (and .cse21 .cse13) (and .cse22 .cse2 (and .cse3 .cse18 .cse23)) (and (and (or (and .cse3 .cse14 .cse24) (and .cse3 .cse21) .cse7) .cse2) .cse22) (and .cse19 .cse13 .cse2 .cse20) (and .cse2 (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse11 .cse25 .cse23)) (and .cse12 .cse2 .cse26 .cse18) (and (and (and .cse14 (<= (+ ~a12~0 49) 0)) .cse24) .cse2) (and .cse2 (<= 103531 ~a12~0) (and .cse1 .cse24)) (and (and .cse12 .cse1) .cse2 .cse3) (and .cse2 .cse27 .cse6) (and .cse22 (and (or (and .cse12 .cse3) (and .cse3 .cse24)) .cse18) .cse2) (and .cse15 .cse10 (and (and (<= 9 ~a21~0) .cse14) .cse2)) (and .cse19 .cse2 .cse27 .cse3) (and .cse2 .cse23 .cse5) (and .cse28 (and .cse2 (and .cse11 .cse24))) (and (= 7 ~a15~0) .cse2 .cse25 .cse23) (and (and (or (and .cse17 .cse3) (and .cse8 .cse3)) .cse2 .cse18) .cse22) (and .cse16 .cse2 .cse17 (<= (+ ~a12~0 9352) 0) .cse18) (and (and (and .cse11 .cse8) .cse1) .cse2) (and .cse16 .cse17 .cse28 .cse2 .cse26 .cse18) (and .cse9 .cse7)))) [2019-11-15 20:45:19,380 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-15 20:45:19,380 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-15 20:45:19,380 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 20:45:19,380 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 20:45:19,380 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-15 20:45:19,380 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-15 20:45:19,380 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-15 20:45:19,380 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 20:45:19,381 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse26 (<= ~a12~0 11)) (.cse12 (<= 10 ~a21~0)) (.cse2 (= ~a24~0 1)) (.cse14 (<= ~a15~0 8)) (.cse23 (= ~a21~0 9))) (let ((.cse4 (= ~a21~0 6)) (.cse0 (not .cse23)) (.cse21 (and .cse12 .cse2 .cse14)) (.cse13 (<= (+ ~a12~0 42) 0)) (.cse20 (= ~a21~0 8)) (.cse6 (= ~a15~0 5)) (.cse15 (<= ~a12~0 75)) (.cse10 (<= 20 ~a12~0)) (.cse19 (= ~a15~0 7)) (.cse27 (= ~a21~0 10)) (.cse5 (= ~a15~0 6)) (.cse24 (<= ~a21~0 6)) (.cse25 (< 0 (+ ~a12~0 43))) (.cse3 (< 80 ~a12~0)) (.cse22 (<= ~a12~0 599999)) (.cse11 (and .cse26 .cse14)) (.cse8 (= ~a21~0 7)) (.cse1 (= 8 ~a15~0)) (.cse16 (= 8 ~a21~0)) (.cse17 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse28 (<= 0 (+ ~a12~0 41))) (.cse18 (= 9 ~a15~0)) (.cse9 (<= ~a12~0 80)) (.cse7 (<= ~a15~0 6))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~a12~0 73281)) (and .cse4 .cse2 .cse5) (and .cse4 .cse2 .cse6) (and .cse7 .cse8) (and (or (and .cse9 .cse0 .cse10 .cse1) (and .cse11 .cse12 .cse1)) .cse2) (and .cse13 .cse2 (and .cse8 .cse14)) (and (and (and .cse15 .cse16 .cse17 (<= 19 ~a12~0)) .cse18) .cse2) (and .cse19 .cse2 .cse3 .cse20) (and .cse21 .cse13) (and .cse22 .cse2 (and .cse3 .cse18 .cse23)) (and (and (or (and .cse3 .cse14 .cse24) (and .cse3 .cse21) .cse7) .cse2) .cse22) (and .cse19 .cse13 .cse2 .cse20) (and .cse2 (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse11 .cse25 .cse23)) (and .cse12 .cse2 .cse26 .cse18) (and (and (and .cse14 (<= (+ ~a12~0 49) 0)) .cse24) .cse2) (and .cse2 (<= 103531 ~a12~0) (and .cse1 .cse24)) (and (and .cse12 .cse1) .cse2 .cse3) (and .cse2 .cse27 .cse6) (and .cse22 (and (or (and .cse12 .cse3) (and .cse3 .cse24)) .cse18) .cse2) (and .cse15 .cse10 (and (and (<= 9 ~a21~0) .cse14) .cse2)) (and .cse19 .cse2 .cse27 .cse3) (and .cse2 .cse23 .cse5) (and .cse28 (and .cse2 (and .cse11 .cse24))) (and (= 7 ~a15~0) .cse2 .cse25 .cse23) (and (and (or (and .cse17 .cse3) (and .cse8 .cse3)) .cse2 .cse18) .cse22) (and .cse16 .cse2 .cse17 (<= (+ ~a12~0 9352) 0) .cse18) (and (and (and .cse11 .cse8) .cse1) .cse2) (and .cse16 .cse17 .cse28 .cse2 .cse26 .cse18) (and .cse9 .cse7)))) [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-15 20:45:19,382 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-15 20:45:19,383 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-15 20:45:19,384 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-15 20:45:19,384 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-15 20:45:19,384 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-15 20:45:19,384 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-15 20:45:19,384 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,384 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,384 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,385 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-15 20:45:19,385 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-15 20:45:19,385 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 20:45:19,385 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 20:45:19,385 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:45:19,385 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 20:45:19,385 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-15 20:45:19,385 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-15 20:45:19,386 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-15 20:45:19,386 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,386 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,386 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,386 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-15 20:45:19,386 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 20:45:19,386 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 20:45:19,386 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 20:45:19,387 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-15 20:45:19,387 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-15 20:45:19,387 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-15 20:45:19,387 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-15 20:45:19,387 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-15 20:45:19,387 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,387 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,387 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:45:19,388 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-15 20:45:19,388 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 20:45:19,388 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 20:45:19,388 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 20:45:19,388 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-15 20:45:19,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:45:19 BoogieIcfgContainer [2019-11-15 20:45:19,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:45:19,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:45:19,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:45:19,441 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:45:19,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:43:38" (3/4) ... [2019-11-15 20:45:19,445 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:45:19,482 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:45:19,484 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:45:19,639 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7ef79f22-4296-411b-bac9-8e2856f4889b/bin/uautomizer/witness.graphml [2019-11-15 20:45:19,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:45:19,641 INFO L168 Benchmark]: Toolchain (without parser) took 103177.09 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 939.4 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-15 20:45:19,641 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:45:19,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:19,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:19,642 INFO L168 Benchmark]: Boogie Preprocessor took 96.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:19,643 INFO L168 Benchmark]: RCFGBuilder took 1508.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.4 MB in the end (delta: 129.1 MB). Peak memory consumption was 129.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:19,643 INFO L168 Benchmark]: TraceAbstraction took 100475.82 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 952.4 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-11-15 20:45:19,644 INFO L168 Benchmark]: Witness Printer took 205.57 ms. Allocated memory is still 5.1 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:19,645 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 771.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1508.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.4 MB in the end (delta: 129.1 MB). Peak memory consumption was 129.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100475.82 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 952.4 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 205.57 ms. Allocated memory is still 5.1 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((!(a21 == 9) && 8 == a15) && a24 == 1) && 80 < a12) && a12 <= 73281) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (a15 <= 6 && a21 == 7)) || (((((a12 <= 80 && !(a21 == 9)) && 20 <= a12) && 8 == a15) || (((a12 <= 11 && a15 <= 8) && 10 <= a21) && 8 == a15)) && a24 == 1)) || ((a12 + 42 <= 0 && a24 == 1) && a21 == 7 && a15 <= 8)) || (((((a12 <= 75 && 8 == a21) && !(1 == input)) && 19 <= a12) && 9 == a15) && a24 == 1)) || (((a15 == 7 && a24 == 1) && 80 < a12) && a21 == 8)) || (((10 <= a21 && a24 == 1) && a15 <= 8) && a12 + 42 <= 0)) || ((a12 <= 599999 && a24 == 1) && (80 < a12 && 9 == a15) && a21 == 9)) || ((((((80 < a12 && a15 <= 8) && a21 <= 6) || (80 < a12 && (10 <= a21 && a24 == 1) && a15 <= 8)) || a15 <= 6) && a24 == 1) && a12 <= 599999)) || (((a15 == 7 && a12 + 42 <= 0) && a24 == 1) && a21 == 8)) || (a24 == 1 && ((!(5 == input) && a12 <= 11 && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((10 <= a21 && a24 == 1) && a12 <= 11) && 9 == a15)) || (((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6) && a24 == 1)) || ((a24 == 1 && 103531 <= a12) && 8 == a15 && a21 <= 6)) || (((10 <= a21 && 8 == a15) && a24 == 1) && 80 < a12)) || ((a24 == 1 && a21 == 10) && a15 == 5)) || ((a12 <= 599999 && ((10 <= a21 && 80 < a12) || (80 < a12 && a21 <= 6)) && 9 == a15) && a24 == 1)) || ((a12 <= 75 && 20 <= a12) && (9 <= a21 && a15 <= 8) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && 80 < a12)) || ((a24 == 1 && a21 == 9) && a15 == 6)) || (0 <= a12 + 41 && a24 == 1 && (a12 <= 11 && a15 <= 8) && a21 <= 6)) || (((7 == a15 && a24 == 1) && 0 < a12 + 43) && a21 == 9)) || (((((!(1 == input) && 80 < a12) || (a21 == 7 && 80 < a12)) && a24 == 1) && 9 == a15) && a12 <= 599999)) || ((((8 == a21 && a24 == 1) && !(1 == input)) && a12 + 9352 <= 0) && 9 == a15)) || ((((a12 <= 11 && a15 <= 8) && a21 == 7) && 8 == a15) && a24 == 1)) || (((((8 == a21 && !(1 == input)) && 0 <= a12 + 41) && a24 == 1) && a12 <= 11) && 9 == a15)) || (a12 <= 80 && a15 <= 6) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((!(a21 == 9) && 8 == a15) && a24 == 1) && 80 < a12) && a12 <= 73281) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (a15 <= 6 && a21 == 7)) || (((((a12 <= 80 && !(a21 == 9)) && 20 <= a12) && 8 == a15) || (((a12 <= 11 && a15 <= 8) && 10 <= a21) && 8 == a15)) && a24 == 1)) || ((a12 + 42 <= 0 && a24 == 1) && a21 == 7 && a15 <= 8)) || (((((a12 <= 75 && 8 == a21) && !(1 == input)) && 19 <= a12) && 9 == a15) && a24 == 1)) || (((a15 == 7 && a24 == 1) && 80 < a12) && a21 == 8)) || (((10 <= a21 && a24 == 1) && a15 <= 8) && a12 + 42 <= 0)) || ((a12 <= 599999 && a24 == 1) && (80 < a12 && 9 == a15) && a21 == 9)) || ((((((80 < a12 && a15 <= 8) && a21 <= 6) || (80 < a12 && (10 <= a21 && a24 == 1) && a15 <= 8)) || a15 <= 6) && a24 == 1) && a12 <= 599999)) || (((a15 == 7 && a12 + 42 <= 0) && a24 == 1) && a21 == 8)) || (a24 == 1 && ((!(5 == input) && a12 <= 11 && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((10 <= a21 && a24 == 1) && a12 <= 11) && 9 == a15)) || (((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6) && a24 == 1)) || ((a24 == 1 && 103531 <= a12) && 8 == a15 && a21 <= 6)) || (((10 <= a21 && 8 == a15) && a24 == 1) && 80 < a12)) || ((a24 == 1 && a21 == 10) && a15 == 5)) || ((a12 <= 599999 && ((10 <= a21 && 80 < a12) || (80 < a12 && a21 <= 6)) && 9 == a15) && a24 == 1)) || ((a12 <= 75 && 20 <= a12) && (9 <= a21 && a15 <= 8) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && 80 < a12)) || ((a24 == 1 && a21 == 9) && a15 == 6)) || (0 <= a12 + 41 && a24 == 1 && (a12 <= 11 && a15 <= 8) && a21 <= 6)) || (((7 == a15 && a24 == 1) && 0 < a12 + 43) && a21 == 9)) || (((((!(1 == input) && 80 < a12) || (a21 == 7 && 80 < a12)) && a24 == 1) && 9 == a15) && a12 <= 599999)) || ((((8 == a21 && a24 == 1) && !(1 == input)) && a12 + 9352 <= 0) && 9 == a15)) || ((((a12 <= 11 && a15 <= 8) && a21 == 7) && 8 == a15) && a24 == 1)) || (((((8 == a21 && !(1 == input)) && 0 <= a12 + 41) && a24 == 1) && a12 <= 11) && 9 == a15)) || (a12 <= 80 && a15 <= 6) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 100.3s, OverallIterations: 25, TraceHistogramMax: 18, AutomataDifference: 28.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, HoareTripleCheckerStatistics: 1845 SDtfs, 8438 SDslu, 428 SDs, 0 SdLazy, 29496 SolverSat, 2310 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9337 GetRequests, 9171 SyntacticMatches, 16 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6056occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 10537 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 110 NumberOfFragments, 1005 HoareAnnotationTreeSize, 3 FomulaSimplifications, 99206178 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7512172 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 35495 NumberOfCodeBlocks, 35495 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 35458 ConstructedInterpolants, 33 QuantifiedInterpolants, 168394607 SizeOfPredicates, 31 NumberOfNonLiveVariables, 11387 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 37 InterpolantComputations, 20 PerfectInterpolantSequences, 164314/166875 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...