java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 15:00:11,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 15:00:11,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 15:00:11,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 15:00:11,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 15:00:11,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 15:00:11,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 15:00:11,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 15:00:11,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 15:00:11,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 15:00:11,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 15:00:11,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 15:00:11,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 15:00:11,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 15:00:11,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 15:00:11,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 15:00:11,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 15:00:11,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 15:00:11,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 15:00:11,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 15:00:11,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 15:00:11,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 15:00:11,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 15:00:11,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 15:00:11,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 15:00:11,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 15:00:11,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 15:00:11,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 15:00:11,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 15:00:11,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 15:00:11,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 15:00:11,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 15:00:11,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 15:00:11,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 15:00:11,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 15:00:11,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 15:00:11,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 15:00:11,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 15:00:11,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 15:00:11,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 15:00:11,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 15:00:11,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 15:00:11,441 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 15:00:11,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 15:00:11,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 15:00:11,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 15:00:11,444 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 15:00:11,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 15:00:11,444 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 15:00:11,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 15:00:11,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 15:00:11,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 15:00:11,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 15:00:11,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 15:00:11,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 15:00:11,446 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 15:00:11,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 15:00:11,447 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 15:00:11,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 15:00:11,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 15:00:11,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 15:00:11,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 15:00:11,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 15:00:11,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 15:00:11,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 15:00:11,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 15:00:11,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 15:00:11,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 15:00:11,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 15:00:11,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 15:00:11,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 15:00:11,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 15:00:11,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 15:00:11,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 15:00:11,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 15:00:11,509 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 15:00:11,510 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-02 15:00:11,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4933a23b/876548b7e27d42c09fe4f5b884ebc55d/FLAGbbbd33e66 [2019-10-02 15:00:12,273 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 15:00:12,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-02 15:00:12,312 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4933a23b/876548b7e27d42c09fe4f5b884ebc55d/FLAGbbbd33e66 [2019-10-02 15:00:12,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4933a23b/876548b7e27d42c09fe4f5b884ebc55d [2019-10-02 15:00:12,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 15:00:12,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 15:00:12,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 15:00:12,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 15:00:12,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 15:00:12,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:00:12" (1/1) ... [2019-10-02 15:00:12,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10033d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:12, skipping insertion in model container [2019-10-02 15:00:12,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:00:12" (1/1) ... [2019-10-02 15:00:12,443 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 15:00:12,599 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 15:00:13,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:00:13,572 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 15:00:14,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:00:14,110 INFO L192 MainTranslator]: Completed translation [2019-10-02 15:00:14,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14 WrapperNode [2019-10-02 15:00:14,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 15:00:14,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 15:00:14,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 15:00:14,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 15:00:14,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14" (1/1) ... [2019-10-02 15:00:14,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14" (1/1) ... [2019-10-02 15:00:14,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14" (1/1) ... [2019-10-02 15:00:14,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14" (1/1) ... [2019-10-02 15:00:14,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14" (1/1) ... [2019-10-02 15:00:14,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14" (1/1) ... [2019-10-02 15:00:14,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14" (1/1) ... [2019-10-02 15:00:14,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 15:00:14,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 15:00:14,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 15:00:14,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 15:00:14,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-02 15:00:14,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 15:00:14,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 15:00:14,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 15:00:14,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 15:00:14,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 15:00:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 15:00:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 15:00:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 15:00:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 15:00:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 15:00:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 15:00:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 15:00:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 15:00:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 15:00:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 15:00:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 15:00:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 15:00:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 15:00:18,009 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 15:00:18,011 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 15:00:18,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:00:18 BoogieIcfgContainer [2019-10-02 15:00:18,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 15:00:18,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 15:00:18,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 15:00:18,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 15:00:18,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 03:00:12" (1/3) ... [2019-10-02 15:00:18,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55af041a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:00:18, skipping insertion in model container [2019-10-02 15:00:18,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14" (2/3) ... [2019-10-02 15:00:18,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55af041a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:00:18, skipping insertion in model container [2019-10-02 15:00:18,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:00:18" (3/3) ... [2019-10-02 15:00:18,026 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-02 15:00:18,038 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 15:00:18,050 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-02 15:00:18,070 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-02 15:00:18,133 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 15:00:18,134 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 15:00:18,134 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 15:00:18,134 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 15:00:18,135 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 15:00:18,135 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 15:00:18,135 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 15:00:18,136 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 15:00:18,136 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 15:00:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states. [2019-10-02 15:00:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 15:00:18,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:18,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:18,208 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash 543541410, now seen corresponding path program 1 times [2019-10-02 15:00:18,217 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:18,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:18,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:18,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:18,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:00:18,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:00:18,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:00:18,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:00:18,998 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand 5 states. [2019-10-02 15:00:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:21,296 INFO L93 Difference]: Finished difference Result 2522 states and 4334 transitions. [2019-10-02 15:00:21,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:00:21,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-02 15:00:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:21,342 INFO L225 Difference]: With dead ends: 2522 [2019-10-02 15:00:21,342 INFO L226 Difference]: Without dead ends: 1594 [2019-10-02 15:00:21,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 15:00:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-10-02 15:00:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1588. [2019-10-02 15:00:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2019-10-02 15:00:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2070 transitions. [2019-10-02 15:00:21,521 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2070 transitions. Word has length 56 [2019-10-02 15:00:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:21,522 INFO L475 AbstractCegarLoop]: Abstraction has 1588 states and 2070 transitions. [2019-10-02 15:00:21,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:00:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2070 transitions. [2019-10-02 15:00:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 15:00:21,527 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:21,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:21,528 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 653011577, now seen corresponding path program 1 times [2019-10-02 15:00:21,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:21,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:21,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:21,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:21,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:21,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:21,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:00:21,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:00:21,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:00:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:00:21,758 INFO L87 Difference]: Start difference. First operand 1588 states and 2070 transitions. Second operand 6 states. [2019-10-02 15:00:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:23,442 INFO L93 Difference]: Finished difference Result 3593 states and 4735 transitions. [2019-10-02 15:00:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:00:23,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-02 15:00:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:23,461 INFO L225 Difference]: With dead ends: 3593 [2019-10-02 15:00:23,461 INFO L226 Difference]: Without dead ends: 2603 [2019-10-02 15:00:23,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-10-02 15:00:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-10-02 15:00:23,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2580. [2019-10-02 15:00:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2019-10-02 15:00:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3414 transitions. [2019-10-02 15:00:23,599 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3414 transitions. Word has length 57 [2019-10-02 15:00:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:23,600 INFO L475 AbstractCegarLoop]: Abstraction has 2580 states and 3414 transitions. [2019-10-02 15:00:23,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:00:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3414 transitions. [2019-10-02 15:00:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 15:00:23,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:23,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:23,604 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:23,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:23,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2124615921, now seen corresponding path program 1 times [2019-10-02 15:00:23,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:23,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:23,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:23,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:23,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:00:23,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:00:23,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:00:23,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:00:23,841 INFO L87 Difference]: Start difference. First operand 2580 states and 3414 transitions. Second operand 6 states. [2019-10-02 15:00:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:25,470 INFO L93 Difference]: Finished difference Result 6102 states and 8181 transitions. [2019-10-02 15:00:25,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:00:25,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-02 15:00:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:25,507 INFO L225 Difference]: With dead ends: 6102 [2019-10-02 15:00:25,507 INFO L226 Difference]: Without dead ends: 4454 [2019-10-02 15:00:25,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-10-02 15:00:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-10-02 15:00:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4438. [2019-10-02 15:00:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-02 15:00:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5921 transitions. [2019-10-02 15:00:25,891 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5921 transitions. Word has length 57 [2019-10-02 15:00:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:25,894 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5921 transitions. [2019-10-02 15:00:25,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:00:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5921 transitions. [2019-10-02 15:00:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 15:00:25,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:25,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:25,901 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:25,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:25,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1225390693, now seen corresponding path program 1 times [2019-10-02 15:00:25,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:25,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:25,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:26,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:26,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:00:26,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:00:26,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:00:26,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:00:26,292 INFO L87 Difference]: Start difference. First operand 4438 states and 5921 transitions. Second operand 9 states. [2019-10-02 15:00:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:30,153 INFO L93 Difference]: Finished difference Result 8492 states and 12034 transitions. [2019-10-02 15:00:30,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 15:00:30,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-02 15:00:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:30,208 INFO L225 Difference]: With dead ends: 8492 [2019-10-02 15:00:30,208 INFO L226 Difference]: Without dead ends: 8486 [2019-10-02 15:00:30,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-02 15:00:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2019-10-02 15:00:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 4438. [2019-10-02 15:00:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-02 15:00:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5920 transitions. [2019-10-02 15:00:30,644 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5920 transitions. Word has length 59 [2019-10-02 15:00:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:30,645 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5920 transitions. [2019-10-02 15:00:30,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:00:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5920 transitions. [2019-10-02 15:00:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 15:00:30,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:30,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:30,650 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2072576560, now seen corresponding path program 1 times [2019-10-02 15:00:30,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:30,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:30,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:30,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:30,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:30,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:00:30,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:00:30,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:00:30,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:00:30,837 INFO L87 Difference]: Start difference. First operand 4438 states and 5920 transitions. Second operand 9 states. [2019-10-02 15:00:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:34,811 INFO L93 Difference]: Finished difference Result 12604 states and 17782 transitions. [2019-10-02 15:00:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 15:00:34,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-02 15:00:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:34,866 INFO L225 Difference]: With dead ends: 12604 [2019-10-02 15:00:34,866 INFO L226 Difference]: Without dead ends: 11461 [2019-10-02 15:00:34,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-02 15:00:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-10-02 15:00:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 4438. [2019-10-02 15:00:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-02 15:00:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5919 transitions. [2019-10-02 15:00:35,324 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5919 transitions. Word has length 59 [2019-10-02 15:00:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:35,324 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5919 transitions. [2019-10-02 15:00:35,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:00:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5919 transitions. [2019-10-02 15:00:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 15:00:35,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:35,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:35,331 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1462179803, now seen corresponding path program 1 times [2019-10-02 15:00:35,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:35,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:35,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:35,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:35,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:00:35,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:00:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:00:35,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:00:35,591 INFO L87 Difference]: Start difference. First operand 4438 states and 5919 transitions. Second operand 8 states. [2019-10-02 15:00:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:38,666 INFO L93 Difference]: Finished difference Result 9646 states and 13819 transitions. [2019-10-02 15:00:38,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 15:00:38,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-10-02 15:00:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:38,689 INFO L225 Difference]: With dead ends: 9646 [2019-10-02 15:00:38,689 INFO L226 Difference]: Without dead ends: 8253 [2019-10-02 15:00:38,696 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-02 15:00:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2019-10-02 15:00:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 4438. [2019-10-02 15:00:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-02 15:00:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5918 transitions. [2019-10-02 15:00:39,002 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5918 transitions. Word has length 59 [2019-10-02 15:00:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:39,003 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5918 transitions. [2019-10-02 15:00:39,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:00:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5918 transitions. [2019-10-02 15:00:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 15:00:39,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:39,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:39,008 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:39,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:39,009 INFO L82 PathProgramCache]: Analyzing trace with hash 895594476, now seen corresponding path program 1 times [2019-10-02 15:00:39,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:39,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:39,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:39,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:39,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:39,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:39,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:39,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:39,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:39,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:39,136 INFO L87 Difference]: Start difference. First operand 4438 states and 5918 transitions. Second operand 3 states. [2019-10-02 15:00:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:39,764 INFO L93 Difference]: Finished difference Result 8143 states and 11088 transitions. [2019-10-02 15:00:39,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:39,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 15:00:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:39,785 INFO L225 Difference]: With dead ends: 8143 [2019-10-02 15:00:39,785 INFO L226 Difference]: Without dead ends: 5548 [2019-10-02 15:00:39,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2019-10-02 15:00:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5542. [2019-10-02 15:00:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2019-10-02 15:00:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7349 transitions. [2019-10-02 15:00:40,135 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7349 transitions. Word has length 60 [2019-10-02 15:00:40,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:40,135 INFO L475 AbstractCegarLoop]: Abstraction has 5542 states and 7349 transitions. [2019-10-02 15:00:40,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7349 transitions. [2019-10-02 15:00:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 15:00:40,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:40,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:40,141 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:40,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:40,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1516341452, now seen corresponding path program 1 times [2019-10-02 15:00:40,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:40,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:40,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:40,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:40,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:40,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:40,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:40,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:40,233 INFO L87 Difference]: Start difference. First operand 5542 states and 7349 transitions. Second operand 3 states. [2019-10-02 15:00:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:40,808 INFO L93 Difference]: Finished difference Result 9044 states and 12648 transitions. [2019-10-02 15:00:40,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:40,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 15:00:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:40,825 INFO L225 Difference]: With dead ends: 9044 [2019-10-02 15:00:40,825 INFO L226 Difference]: Without dead ends: 6694 [2019-10-02 15:00:40,833 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2019-10-02 15:00:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6090. [2019-10-02 15:00:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6090 states. [2019-10-02 15:00:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 8232 transitions. [2019-10-02 15:00:41,364 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 8232 transitions. Word has length 60 [2019-10-02 15:00:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:41,365 INFO L475 AbstractCegarLoop]: Abstraction has 6090 states and 8232 transitions. [2019-10-02 15:00:41,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 8232 transitions. [2019-10-02 15:00:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 15:00:41,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:41,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:41,370 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:41,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash -514589220, now seen corresponding path program 1 times [2019-10-02 15:00:41,370 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:41,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:41,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:41,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:41,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:41,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:41,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:41,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:41,455 INFO L87 Difference]: Start difference. First operand 6090 states and 8232 transitions. Second operand 3 states. [2019-10-02 15:00:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:41,994 INFO L93 Difference]: Finished difference Result 11404 states and 16131 transitions. [2019-10-02 15:00:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:41,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 15:00:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:42,015 INFO L225 Difference]: With dead ends: 11404 [2019-10-02 15:00:42,015 INFO L226 Difference]: Without dead ends: 8067 [2019-10-02 15:00:42,026 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-10-02 15:00:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 7151. [2019-10-02 15:00:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-10-02 15:00:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9773 transitions. [2019-10-02 15:00:42,730 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9773 transitions. Word has length 60 [2019-10-02 15:00:42,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:42,731 INFO L475 AbstractCegarLoop]: Abstraction has 7151 states and 9773 transitions. [2019-10-02 15:00:42,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9773 transitions. [2019-10-02 15:00:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 15:00:42,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:42,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:42,741 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:42,742 INFO L82 PathProgramCache]: Analyzing trace with hash -293371609, now seen corresponding path program 1 times [2019-10-02 15:00:42,742 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:42,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:42,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:42,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:42,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:42,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:42,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:42,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:42,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:42,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:42,826 INFO L87 Difference]: Start difference. First operand 7151 states and 9773 transitions. Second operand 3 states. [2019-10-02 15:00:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:43,720 INFO L93 Difference]: Finished difference Result 15308 states and 21660 transitions. [2019-10-02 15:00:43,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:43,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-02 15:00:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:43,744 INFO L225 Difference]: With dead ends: 15308 [2019-10-02 15:00:43,744 INFO L226 Difference]: Without dead ends: 9721 [2019-10-02 15:00:43,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9721 states. [2019-10-02 15:00:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9721 to 7854. [2019-10-02 15:00:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2019-10-02 15:00:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 11004 transitions. [2019-10-02 15:00:44,538 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 11004 transitions. Word has length 61 [2019-10-02 15:00:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:44,538 INFO L475 AbstractCegarLoop]: Abstraction has 7854 states and 11004 transitions. [2019-10-02 15:00:44,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 11004 transitions. [2019-10-02 15:00:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 15:00:44,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:44,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:44,543 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:44,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2069285283, now seen corresponding path program 1 times [2019-10-02 15:00:44,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:44,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:44,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:44,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:44,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:44,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:44,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 15:00:44,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:00:44,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:00:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:00:44,953 INFO L87 Difference]: Start difference. First operand 7854 states and 11004 transitions. Second operand 10 states. [2019-10-02 15:00:45,614 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-10-02 15:00:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:49,167 INFO L93 Difference]: Finished difference Result 30006 states and 43273 transitions. [2019-10-02 15:00:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 15:00:49,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-10-02 15:00:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:49,290 INFO L225 Difference]: With dead ends: 30006 [2019-10-02 15:00:49,290 INFO L226 Difference]: Without dead ends: 29698 [2019-10-02 15:00:49,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 15:00:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29698 states. [2019-10-02 15:00:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29698 to 7736. [2019-10-02 15:00:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7736 states. [2019-10-02 15:00:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7736 states to 7736 states and 10857 transitions. [2019-10-02 15:00:50,161 INFO L78 Accepts]: Start accepts. Automaton has 7736 states and 10857 transitions. Word has length 61 [2019-10-02 15:00:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:50,161 INFO L475 AbstractCegarLoop]: Abstraction has 7736 states and 10857 transitions. [2019-10-02 15:00:50,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 15:00:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7736 states and 10857 transitions. [2019-10-02 15:00:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 15:00:50,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:50,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:50,164 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:50,164 INFO L82 PathProgramCache]: Analyzing trace with hash -169233154, now seen corresponding path program 1 times [2019-10-02 15:00:50,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:50,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:50,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:50,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:50,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:50,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:50,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:50,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:50,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:50,240 INFO L87 Difference]: Start difference. First operand 7736 states and 10857 transitions. Second operand 3 states. [2019-10-02 15:00:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:51,598 INFO L93 Difference]: Finished difference Result 18635 states and 26760 transitions. [2019-10-02 15:00:51,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:51,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-02 15:00:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:51,611 INFO L225 Difference]: With dead ends: 18635 [2019-10-02 15:00:51,611 INFO L226 Difference]: Without dead ends: 11823 [2019-10-02 15:00:51,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2019-10-02 15:00:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 9317. [2019-10-02 15:00:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9317 states. [2019-10-02 15:00:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9317 states to 9317 states and 13301 transitions. [2019-10-02 15:00:52,636 INFO L78 Accepts]: Start accepts. Automaton has 9317 states and 13301 transitions. Word has length 61 [2019-10-02 15:00:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:52,636 INFO L475 AbstractCegarLoop]: Abstraction has 9317 states and 13301 transitions. [2019-10-02 15:00:52,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 9317 states and 13301 transitions. [2019-10-02 15:00:52,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 15:00:52,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:52,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:52,638 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:52,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash 58994233, now seen corresponding path program 1 times [2019-10-02 15:00:52,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:52,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:52,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:52,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:52,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:52,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:52,714 INFO L87 Difference]: Start difference. First operand 9317 states and 13301 transitions. Second operand 3 states. [2019-10-02 15:00:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:53,885 INFO L93 Difference]: Finished difference Result 19670 states and 28318 transitions. [2019-10-02 15:00:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:53,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-02 15:00:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:53,898 INFO L225 Difference]: With dead ends: 19670 [2019-10-02 15:00:53,898 INFO L226 Difference]: Without dead ends: 10779 [2019-10-02 15:00:53,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10779 states. [2019-10-02 15:00:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10779 to 8552. [2019-10-02 15:00:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8552 states. [2019-10-02 15:00:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8552 states to 8552 states and 12300 transitions. [2019-10-02 15:00:54,894 INFO L78 Accepts]: Start accepts. Automaton has 8552 states and 12300 transitions. Word has length 61 [2019-10-02 15:00:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:54,895 INFO L475 AbstractCegarLoop]: Abstraction has 8552 states and 12300 transitions. [2019-10-02 15:00:54,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8552 states and 12300 transitions. [2019-10-02 15:00:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 15:00:54,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:54,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:54,896 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash -244084559, now seen corresponding path program 1 times [2019-10-02 15:00:54,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:54,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:54,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:55,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:55,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 15:00:55,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 15:00:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 15:00:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-02 15:00:55,682 INFO L87 Difference]: Start difference. First operand 8552 states and 12300 transitions. Second operand 19 states. [2019-10-02 15:00:55,881 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-10-02 15:00:56,892 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-02 15:00:57,166 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-02 15:00:57,332 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-02 15:00:57,560 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-02 15:00:58,128 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-02 15:01:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:07,105 INFO L93 Difference]: Finished difference Result 32514 states and 47407 transitions. [2019-10-02 15:01:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 15:01:07,106 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2019-10-02 15:01:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:07,154 INFO L225 Difference]: With dead ends: 32514 [2019-10-02 15:01:07,154 INFO L226 Difference]: Without dead ends: 32510 [2019-10-02 15:01:07,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 15:01:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32510 states. [2019-10-02 15:01:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32510 to 8565. [2019-10-02 15:01:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8565 states. [2019-10-02 15:01:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8565 states to 8565 states and 12318 transitions. [2019-10-02 15:01:08,409 INFO L78 Accepts]: Start accepts. Automaton has 8565 states and 12318 transitions. Word has length 62 [2019-10-02 15:01:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:08,410 INFO L475 AbstractCegarLoop]: Abstraction has 8565 states and 12318 transitions. [2019-10-02 15:01:08,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 15:01:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 8565 states and 12318 transitions. [2019-10-02 15:01:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 15:01:08,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:08,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:08,412 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:08,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1004192523, now seen corresponding path program 1 times [2019-10-02 15:01:08,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:08,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:08,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:08,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:08,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:08,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:08,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 15:01:08,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 15:01:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 15:01:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-02 15:01:08,887 INFO L87 Difference]: Start difference. First operand 8565 states and 12318 transitions. Second operand 14 states. [2019-10-02 15:01:10,865 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-02 15:01:11,299 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-02 15:01:12,063 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-10-02 15:01:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:15,669 INFO L93 Difference]: Finished difference Result 19265 states and 27705 transitions. [2019-10-02 15:01:15,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 15:01:15,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-10-02 15:01:15,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:15,691 INFO L225 Difference]: With dead ends: 19265 [2019-10-02 15:01:15,692 INFO L226 Difference]: Without dead ends: 19021 [2019-10-02 15:01:15,697 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=325, Invalid=797, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 15:01:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19021 states. [2019-10-02 15:01:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19021 to 8503. [2019-10-02 15:01:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8503 states. [2019-10-02 15:01:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8503 states to 8503 states and 12238 transitions. [2019-10-02 15:01:16,937 INFO L78 Accepts]: Start accepts. Automaton has 8503 states and 12238 transitions. Word has length 63 [2019-10-02 15:01:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:16,937 INFO L475 AbstractCegarLoop]: Abstraction has 8503 states and 12238 transitions. [2019-10-02 15:01:16,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 15:01:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 8503 states and 12238 transitions. [2019-10-02 15:01:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 15:01:16,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:16,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:01:16,940 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2123353110, now seen corresponding path program 1 times [2019-10-02 15:01:16,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:16,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:16,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:17,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:17,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:01:17,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:01:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:01:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:01:17,054 INFO L87 Difference]: Start difference. First operand 8503 states and 12238 transitions. Second operand 6 states. [2019-10-02 15:01:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:21,883 INFO L93 Difference]: Finished difference Result 37797 states and 54623 transitions. [2019-10-02 15:01:21,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 15:01:21,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-02 15:01:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:21,920 INFO L225 Difference]: With dead ends: 37797 [2019-10-02 15:01:21,920 INFO L226 Difference]: Without dead ends: 29969 [2019-10-02 15:01:21,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 15:01:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29969 states. [2019-10-02 15:01:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29969 to 26297. [2019-10-02 15:01:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26297 states. [2019-10-02 15:01:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26297 states to 26297 states and 37105 transitions. [2019-10-02 15:01:26,615 INFO L78 Accepts]: Start accepts. Automaton has 26297 states and 37105 transitions. Word has length 70 [2019-10-02 15:01:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:26,615 INFO L475 AbstractCegarLoop]: Abstraction has 26297 states and 37105 transitions. [2019-10-02 15:01:26,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:01:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 26297 states and 37105 transitions. [2019-10-02 15:01:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 15:01:26,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:26,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:01:26,619 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:26,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:26,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1078555367, now seen corresponding path program 1 times [2019-10-02 15:01:26,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:26,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:26,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:26,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:26,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:01:26,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:01:26,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:01:26,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:26,728 INFO L87 Difference]: Start difference. First operand 26297 states and 37105 transitions. Second operand 5 states. [2019-10-02 15:01:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:30,377 INFO L93 Difference]: Finished difference Result 46231 states and 65243 transitions. [2019-10-02 15:01:30,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:01:30,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-02 15:01:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:30,400 INFO L225 Difference]: With dead ends: 46231 [2019-10-02 15:01:30,400 INFO L226 Difference]: Without dead ends: 20595 [2019-10-02 15:01:30,429 INFO L640 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-10-02 15:01:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20595 states. [2019-10-02 15:01:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20595 to 20591. [2019-10-02 15:01:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20591 states. [2019-10-02 15:01:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20591 states to 20591 states and 28878 transitions. [2019-10-02 15:01:33,966 INFO L78 Accepts]: Start accepts. Automaton has 20591 states and 28878 transitions. Word has length 71 [2019-10-02 15:01:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:33,967 INFO L475 AbstractCegarLoop]: Abstraction has 20591 states and 28878 transitions. [2019-10-02 15:01:33,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:01:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 20591 states and 28878 transitions. [2019-10-02 15:01:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 15:01:33,972 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:33,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:01:33,972 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:33,972 INFO L82 PathProgramCache]: Analyzing trace with hash 781945202, now seen corresponding path program 1 times [2019-10-02 15:01:33,973 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:33,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:33,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:34,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:34,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:01:34,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:01:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:01:34,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:01:34,081 INFO L87 Difference]: Start difference. First operand 20591 states and 28878 transitions. Second operand 6 states. [2019-10-02 15:01:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:41,156 INFO L93 Difference]: Finished difference Result 35792 states and 49626 transitions. [2019-10-02 15:01:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:01:41,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-02 15:01:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:41,197 INFO L225 Difference]: With dead ends: 35792 [2019-10-02 15:01:41,197 INFO L226 Difference]: Without dead ends: 35790 [2019-10-02 15:01:41,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:01:41,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35790 states. [2019-10-02 15:01:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35790 to 21257. [2019-10-02 15:01:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21257 states. [2019-10-02 15:01:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21257 states to 21257 states and 29387 transitions. [2019-10-02 15:01:45,081 INFO L78 Accepts]: Start accepts. Automaton has 21257 states and 29387 transitions. Word has length 73 [2019-10-02 15:01:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:45,081 INFO L475 AbstractCegarLoop]: Abstraction has 21257 states and 29387 transitions. [2019-10-02 15:01:45,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:01:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 21257 states and 29387 transitions. [2019-10-02 15:01:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 15:01:45,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:45,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:01:45,085 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1414482205, now seen corresponding path program 1 times [2019-10-02 15:01:45,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:45,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:45,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:45,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:45,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:45,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:45,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:45,173 INFO L87 Difference]: Start difference. First operand 21257 states and 29387 transitions. Second operand 3 states. [2019-10-02 15:01:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:52,123 INFO L93 Difference]: Finished difference Result 57855 states and 80104 transitions. [2019-10-02 15:01:52,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:52,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-02 15:01:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:52,168 INFO L225 Difference]: With dead ends: 57855 [2019-10-02 15:01:52,168 INFO L226 Difference]: Without dead ends: 37259 [2019-10-02 15:01:52,198 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37259 states. [2019-10-02 15:01:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37259 to 37257. [2019-10-02 15:01:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37257 states. [2019-10-02 15:01:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37257 states to 37257 states and 51079 transitions. [2019-10-02 15:01:59,855 INFO L78 Accepts]: Start accepts. Automaton has 37257 states and 51079 transitions. Word has length 74 [2019-10-02 15:01:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:59,855 INFO L475 AbstractCegarLoop]: Abstraction has 37257 states and 51079 transitions. [2019-10-02 15:01:59,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 37257 states and 51079 transitions. [2019-10-02 15:01:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 15:01:59,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:59,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:01:59,860 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:59,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1190739596, now seen corresponding path program 1 times [2019-10-02 15:01:59,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:59,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:59,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:59,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:59,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:59,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:59,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:01:59,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:01:59,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:01:59,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:59,938 INFO L87 Difference]: Start difference. First operand 37257 states and 51079 transitions. Second operand 5 states. [2019-10-02 15:02:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:20,138 INFO L93 Difference]: Finished difference Result 133709 states and 183072 transitions. [2019-10-02 15:02:20,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:02:20,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-02 15:02:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:20,290 INFO L225 Difference]: With dead ends: 133709 [2019-10-02 15:02:20,290 INFO L226 Difference]: Without dead ends: 97056 [2019-10-02 15:02:20,337 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:02:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97056 states. [2019-10-02 15:02:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97056 to 36828. [2019-10-02 15:02:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36828 states. [2019-10-02 15:02:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36828 states to 36828 states and 49856 transitions. [2019-10-02 15:02:29,253 INFO L78 Accepts]: Start accepts. Automaton has 36828 states and 49856 transitions. Word has length 76 [2019-10-02 15:02:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:29,253 INFO L475 AbstractCegarLoop]: Abstraction has 36828 states and 49856 transitions. [2019-10-02 15:02:29,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:02:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 36828 states and 49856 transitions. [2019-10-02 15:02:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 15:02:29,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:29,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:02:29,257 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:29,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2062750855, now seen corresponding path program 1 times [2019-10-02 15:02:29,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:29,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:29,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:29,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:29,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:29,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:29,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:29,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:29,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:29,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:29,336 INFO L87 Difference]: Start difference. First operand 36828 states and 49856 transitions. Second operand 3 states. [2019-10-02 15:02:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:36,377 INFO L93 Difference]: Finished difference Result 46722 states and 63152 transitions. [2019-10-02 15:02:36,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:36,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-02 15:02:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:36,417 INFO L225 Difference]: With dead ends: 46722 [2019-10-02 15:02:36,417 INFO L226 Difference]: Without dead ends: 36830 [2019-10-02 15:02:36,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36830 states. [2019-10-02 15:02:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36830 to 30282. [2019-10-02 15:02:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30282 states. [2019-10-02 15:02:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30282 states to 30282 states and 40584 transitions. [2019-10-02 15:02:42,600 INFO L78 Accepts]: Start accepts. Automaton has 30282 states and 40584 transitions. Word has length 77 [2019-10-02 15:02:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:42,600 INFO L475 AbstractCegarLoop]: Abstraction has 30282 states and 40584 transitions. [2019-10-02 15:02:42,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:02:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 30282 states and 40584 transitions. [2019-10-02 15:02:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 15:02:42,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:42,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:02:42,604 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:42,605 INFO L82 PathProgramCache]: Analyzing trace with hash -667932309, now seen corresponding path program 1 times [2019-10-02 15:02:42,605 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:42,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:42,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:42,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:02:42,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:02:42,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:02:42,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:02:42,693 INFO L87 Difference]: Start difference. First operand 30282 states and 40584 transitions. Second operand 5 states. [2019-10-02 15:02:43,153 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-10-02 15:03:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:05,997 INFO L93 Difference]: Finished difference Result 126851 states and 169250 transitions. [2019-10-02 15:03:05,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:03:05,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-02 15:03:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:06,134 INFO L225 Difference]: With dead ends: 126851 [2019-10-02 15:03:06,134 INFO L226 Difference]: Without dead ends: 97198 [2019-10-02 15:03:06,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:03:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97198 states. [2019-10-02 15:03:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97198 to 50426. [2019-10-02 15:03:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50426 states. [2019-10-02 15:03:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50426 states to 50426 states and 67138 transitions. [2019-10-02 15:03:17,369 INFO L78 Accepts]: Start accepts. Automaton has 50426 states and 67138 transitions. Word has length 78 [2019-10-02 15:03:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:17,369 INFO L475 AbstractCegarLoop]: Abstraction has 50426 states and 67138 transitions. [2019-10-02 15:03:17,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:03:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 50426 states and 67138 transitions. [2019-10-02 15:03:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-02 15:03:17,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:17,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:03:17,373 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:17,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:17,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1157971312, now seen corresponding path program 1 times [2019-10-02 15:03:17,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:17,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:17,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:17,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:17,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:03:17,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:17,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:03:17,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:03:17,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:03:17,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:03:17,713 INFO L87 Difference]: Start difference. First operand 50426 states and 67138 transitions. Second operand 5 states. [2019-10-02 15:03:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:56,127 INFO L93 Difference]: Finished difference Result 205776 states and 273035 transitions. [2019-10-02 15:03:56,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:03:56,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-02 15:03:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:56,344 INFO L225 Difference]: With dead ends: 205776 [2019-10-02 15:03:56,344 INFO L226 Difference]: Without dead ends: 155957 [2019-10-02 15:03:56,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:03:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155957 states. [2019-10-02 15:04:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155957 to 101537. [2019-10-02 15:04:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101537 states. [2019-10-02 15:04:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101537 states to 101537 states and 134196 transitions. [2019-10-02 15:04:21,283 INFO L78 Accepts]: Start accepts. Automaton has 101537 states and 134196 transitions. Word has length 81 [2019-10-02 15:04:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:21,283 INFO L475 AbstractCegarLoop]: Abstraction has 101537 states and 134196 transitions. [2019-10-02 15:04:21,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:04:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 101537 states and 134196 transitions. [2019-10-02 15:04:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 15:04:21,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:21,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:04:21,288 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2119187877, now seen corresponding path program 1 times [2019-10-02 15:04:21,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:21,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:21,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:04:21,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:21,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:04:21,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:04:21,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:04:21,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:04:21,387 INFO L87 Difference]: Start difference. First operand 101537 states and 134196 transitions. Second operand 3 states. [2019-10-02 15:04:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:46,772 INFO L93 Difference]: Finished difference Result 199874 states and 263401 transitions. [2019-10-02 15:04:46,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:04:46,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-02 15:04:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:46,907 INFO L225 Difference]: With dead ends: 199874 [2019-10-02 15:04:46,907 INFO L226 Difference]: Without dead ends: 98952 [2019-10-02 15:04:46,979 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:04:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98952 states. [2019-10-02 15:05:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98952 to 81560. [2019-10-02 15:05:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81560 states. [2019-10-02 15:05:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81560 states to 81560 states and 105730 transitions. [2019-10-02 15:05:06,142 INFO L78 Accepts]: Start accepts. Automaton has 81560 states and 105730 transitions. Word has length 83 [2019-10-02 15:05:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:06,142 INFO L475 AbstractCegarLoop]: Abstraction has 81560 states and 105730 transitions. [2019-10-02 15:05:06,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:05:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 81560 states and 105730 transitions. [2019-10-02 15:05:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 15:05:06,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:06,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 15:05:06,146 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:06,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:06,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1400576218, now seen corresponding path program 1 times [2019-10-02 15:05:06,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:06,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:06,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:06,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:06,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:06,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:06,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:06,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:06,222 INFO L87 Difference]: Start difference. First operand 81560 states and 105730 transitions. Second operand 3 states. [2019-10-02 15:05:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:31,471 INFO L93 Difference]: Finished difference Result 179347 states and 232245 transitions. [2019-10-02 15:05:31,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:31,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-02 15:05:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:31,726 INFO L225 Difference]: With dead ends: 179347 [2019-10-02 15:05:31,726 INFO L226 Difference]: Without dead ends: 98386 [2019-10-02 15:05:31,783 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98386 states. [2019-10-02 15:05:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98386 to 93889. [2019-10-02 15:05:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93889 states. [2019-10-02 15:05:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93889 states to 93889 states and 120482 transitions. [2019-10-02 15:05:53,901 INFO L78 Accepts]: Start accepts. Automaton has 93889 states and 120482 transitions. Word has length 86 [2019-10-02 15:05:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:53,901 INFO L475 AbstractCegarLoop]: Abstraction has 93889 states and 120482 transitions. [2019-10-02 15:05:53,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:05:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 93889 states and 120482 transitions. [2019-10-02 15:05:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 15:05:53,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:53,910 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:05:53,910 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash 213751766, now seen corresponding path program 1 times [2019-10-02 15:05:53,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:53,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:53,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:53,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:53,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 15:05:54,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:54,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:54,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:54,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:54,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:54,004 INFO L87 Difference]: Start difference. First operand 93889 states and 120482 transitions. Second operand 3 states. [2019-10-02 15:06:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:37,143 INFO L93 Difference]: Finished difference Result 262019 states and 334382 transitions. [2019-10-02 15:06:37,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:06:37,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-02 15:06:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:37,364 INFO L225 Difference]: With dead ends: 262019 [2019-10-02 15:06:37,364 INFO L226 Difference]: Without dead ends: 168729 [2019-10-02 15:06:37,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:06:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168729 states. [2019-10-02 15:07:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168729 to 148920. [2019-10-02 15:07:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148920 states. [2019-10-02 15:07:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148920 states to 148920 states and 187364 transitions. [2019-10-02 15:07:16,623 INFO L78 Accepts]: Start accepts. Automaton has 148920 states and 187364 transitions. Word has length 94 [2019-10-02 15:07:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:16,624 INFO L475 AbstractCegarLoop]: Abstraction has 148920 states and 187364 transitions. [2019-10-02 15:07:16,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:07:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 148920 states and 187364 transitions. [2019-10-02 15:07:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 15:07:16,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:16,633 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:07:16,633 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash -383116103, now seen corresponding path program 1 times [2019-10-02 15:07:16,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:16,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:16,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:16,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:16,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:07:16,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:07:16,759 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:07:16,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:17,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 15:07:17,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:07:17,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:07:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 15:07:17,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:07:17,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-10-02 15:07:17,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 15:07:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 15:07:17,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 15:07:17,526 INFO L87 Difference]: Start difference. First operand 148920 states and 187364 transitions. Second operand 13 states. [2019-10-02 15:08:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:08:57,062 INFO L93 Difference]: Finished difference Result 500912 states and 631167 transitions. [2019-10-02 15:08:57,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 15:08:57,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-10-02 15:08:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:08:57,891 INFO L225 Difference]: With dead ends: 500912 [2019-10-02 15:08:57,891 INFO L226 Difference]: Without dead ends: 352591 [2019-10-02 15:08:58,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=399, Invalid=1161, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 15:08:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352591 states. [2019-10-02 15:09:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352591 to 193309. [2019-10-02 15:09:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193309 states. [2019-10-02 15:09:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193309 states to 193309 states and 243026 transitions. [2019-10-02 15:09:56,005 INFO L78 Accepts]: Start accepts. Automaton has 193309 states and 243026 transitions. Word has length 97 [2019-10-02 15:09:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:56,005 INFO L475 AbstractCegarLoop]: Abstraction has 193309 states and 243026 transitions. [2019-10-02 15:09:56,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 15:09:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 193309 states and 243026 transitions. [2019-10-02 15:09:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 15:09:56,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:56,030 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:09:56,030 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:56,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2107665468, now seen corresponding path program 1 times [2019-10-02 15:09:56,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:56,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:56,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:56,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:56,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:56,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:56,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:56,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:56,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:56,199 INFO L87 Difference]: Start difference. First operand 193309 states and 243026 transitions. Second operand 3 states. [2019-10-02 15:10:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:36,531 INFO L93 Difference]: Finished difference Result 242281 states and 303804 transitions. [2019-10-02 15:10:36,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:10:36,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-02 15:10:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:36,911 INFO L225 Difference]: With dead ends: 242281 [2019-10-02 15:10:36,912 INFO L226 Difference]: Without dead ends: 146879 [2019-10-02 15:10:37,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:10:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146879 states. [2019-10-02 15:11:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146879 to 146685. [2019-10-02 15:11:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146685 states. [2019-10-02 15:11:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146685 states to 146685 states and 181951 transitions. [2019-10-02 15:11:21,138 INFO L78 Accepts]: Start accepts. Automaton has 146685 states and 181951 transitions. Word has length 98 [2019-10-02 15:11:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:11:21,138 INFO L475 AbstractCegarLoop]: Abstraction has 146685 states and 181951 transitions. [2019-10-02 15:11:21,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:11:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 146685 states and 181951 transitions. [2019-10-02 15:11:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 15:11:21,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:11:21,147 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:11:21,147 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:11:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:11:21,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1350911043, now seen corresponding path program 1 times [2019-10-02 15:11:21,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:11:21,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:11:21,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:21,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:11:21,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:11:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:11:21,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:11:21,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:11:21,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:11:21,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:11:21,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:11:21,241 INFO L87 Difference]: Start difference. First operand 146685 states and 181951 transitions. Second operand 5 states. [2019-10-02 15:12:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:12:14,633 INFO L93 Difference]: Finished difference Result 317325 states and 393943 transitions. [2019-10-02 15:12:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:12:14,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-02 15:12:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:12:14,978 INFO L225 Difference]: With dead ends: 317325 [2019-10-02 15:12:14,978 INFO L226 Difference]: Without dead ends: 171486 [2019-10-02 15:12:15,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:12:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171486 states. [2019-10-02 15:12:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171486 to 142162. [2019-10-02 15:12:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142162 states. [2019-10-02 15:12:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142162 states to 142162 states and 174090 transitions. [2019-10-02 15:12:54,280 INFO L78 Accepts]: Start accepts. Automaton has 142162 states and 174090 transitions. Word has length 99 [2019-10-02 15:12:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:12:54,280 INFO L475 AbstractCegarLoop]: Abstraction has 142162 states and 174090 transitions. [2019-10-02 15:12:54,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:12:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 142162 states and 174090 transitions. [2019-10-02 15:12:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 15:12:54,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:12:54,288 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:12:54,288 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:12:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:12:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1499550427, now seen corresponding path program 1 times [2019-10-02 15:12:54,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:12:54,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:12:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:54,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:12:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:12:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 15:12:54,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:12:54,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:12:54,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:12:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:12:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:12:54,380 INFO L87 Difference]: Start difference. First operand 142162 states and 174090 transitions. Second operand 3 states.