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.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:48:03,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:48:03,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:48:03,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:48:03,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:48:03,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:48:03,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:48:03,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:48:03,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:48:03,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:48:03,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:48:03,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:48:03,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:48:03,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:48:03,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:48:03,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:48:03,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:48:03,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:48:03,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:48:03,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:48:03,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:48:03,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:48:03,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:48:03,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:48:03,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:48:03,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:48:03,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:48:03,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:48:03,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:48:03,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:48:03,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:48:03,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:48:03,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:48:03,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:48:03,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:48:03,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:48:03,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:48:03,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:48:03,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:48:03,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:48:03,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:48:03,490 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-09-08 10:48:03,516 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:48:03,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:48:03,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:48:03,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:48:03,519 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:48:03,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:48:03,519 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:48:03,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:48:03,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:48:03,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:48:03,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:48:03,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:48:03,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:48:03,522 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:48:03,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:48:03,522 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:48:03,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:48:03,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:48:03,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:48:03,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:48:03,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:48:03,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:48:03,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:48:03,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:48:03,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:48:03,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:48:03,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:48:03,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:48:03,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:48:03,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:48:03,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:48:03,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:48:03,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:48:03,586 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:48:03,587 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.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:48:03,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad92cc38/abe27ace8f264c399a3adf30a5a5533d/FLAG048133424 [2019-09-08 10:48:04,348 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:48:04,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:48:04,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad92cc38/abe27ace8f264c399a3adf30a5a5533d/FLAG048133424 [2019-09-08 10:48:04,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad92cc38/abe27ace8f264c399a3adf30a5a5533d [2019-09-08 10:48:04,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:48:04,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:48:04,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:48:04,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:48:04,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:48:04,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:48:04" (1/1) ... [2019-09-08 10:48:04,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7926a32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:04, skipping insertion in model container [2019-09-08 10:48:04,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:48:04" (1/1) ... [2019-09-08 10:48:04,532 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:48:04,638 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:48:05,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:48:05,571 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:48:05,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:48:05,878 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:48:05,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05 WrapperNode [2019-09-08 10:48:05,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:48:05,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:48:05,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:48:05,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:48:05,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05" (1/1) ... [2019-09-08 10:48:05,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05" (1/1) ... [2019-09-08 10:48:05,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05" (1/1) ... [2019-09-08 10:48:05,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05" (1/1) ... [2019-09-08 10:48:06,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05" (1/1) ... [2019-09-08 10:48:06,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05" (1/1) ... [2019-09-08 10:48:06,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05" (1/1) ... [2019-09-08 10:48:06,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:48:06,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:48:06,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:48:06,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:48:06,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05" (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-09-08 10:48:06,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:48:06,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:48:06,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:48:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:48:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:48:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:48:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:48:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:48:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:48:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:48:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:48:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:48:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:48:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:48:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:48:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:48:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:48:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:48:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:48:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:48:08,539 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:48:08,539 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:48:08,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:48:08 BoogieIcfgContainer [2019-09-08 10:48:08,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:48:08,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:48:08,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:48:08,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:48:08,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:48:04" (1/3) ... [2019-09-08 10:48:08,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7523f225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:48:08, skipping insertion in model container [2019-09-08 10:48:08,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:48:05" (2/3) ... [2019-09-08 10:48:08,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7523f225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:48:08, skipping insertion in model container [2019-09-08 10:48:08,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:48:08" (3/3) ... [2019-09-08 10:48:08,553 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:48:08,565 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:48:08,591 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 10:48:08,616 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 10:48:08,665 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:48:08,666 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:48:08,666 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:48:08,666 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:48:08,666 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:48:08,666 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:48:08,666 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:48:08,667 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:48:08,667 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:48:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states. [2019-09-08 10:48:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:48:08,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:08,737 INFO L399 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] [2019-09-08 10:48:08,739 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:08,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:08,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1231331232, now seen corresponding path program 1 times [2019-09-08 10:48:08,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:08,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:08,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:08,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:08,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:09,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:09,329 INFO L87 Difference]: Start difference. First operand 707 states. Second operand 3 states. [2019-09-08 10:48:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:09,476 INFO L93 Difference]: Finished difference Result 1070 states and 1856 transitions. [2019-09-08 10:48:09,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:09,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:48:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:09,498 INFO L225 Difference]: With dead ends: 1070 [2019-09-08 10:48:09,498 INFO L226 Difference]: Without dead ends: 846 [2019-09-08 10:48:09,504 INFO L628 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-09-08 10:48:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-09-08 10:48:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2019-09-08 10:48:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-08 10:48:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1154 transitions. [2019-09-08 10:48:09,638 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1154 transitions. Word has length 66 [2019-09-08 10:48:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:09,638 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1154 transitions. [2019-09-08 10:48:09,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1154 transitions. [2019-09-08 10:48:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:48:09,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:09,645 INFO L399 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] [2019-09-08 10:48:09,645 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:09,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1406661015, now seen corresponding path program 1 times [2019-09-08 10:48:09,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:09,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:09,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:09,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:09,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:09,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:09,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:09,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:09,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:09,808 INFO L87 Difference]: Start difference. First operand 844 states and 1154 transitions. Second operand 3 states. [2019-09-08 10:48:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:09,953 INFO L93 Difference]: Finished difference Result 1410 states and 1998 transitions. [2019-09-08 10:48:09,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:09,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:48:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:09,960 INFO L225 Difference]: With dead ends: 1410 [2019-09-08 10:48:09,960 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 10:48:09,963 INFO L628 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-09-08 10:48:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 10:48:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1102. [2019-09-08 10:48:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-09-08 10:48:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1531 transitions. [2019-09-08 10:48:10,001 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1531 transitions. Word has length 67 [2019-09-08 10:48:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:10,002 INFO L475 AbstractCegarLoop]: Abstraction has 1102 states and 1531 transitions. [2019-09-08 10:48:10,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1531 transitions. [2019-09-08 10:48:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:48:10,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:10,005 INFO L399 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] [2019-09-08 10:48:10,005 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:10,006 INFO L82 PathProgramCache]: Analyzing trace with hash -260201894, now seen corresponding path program 1 times [2019-09-08 10:48:10,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:10,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:10,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:10,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:10,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:10,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:10,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:10,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:10,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:10,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:10,102 INFO L87 Difference]: Start difference. First operand 1102 states and 1531 transitions. Second operand 3 states. [2019-09-08 10:48:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:10,281 INFO L93 Difference]: Finished difference Result 2108 states and 2962 transitions. [2019-09-08 10:48:10,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:10,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:48:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:10,291 INFO L225 Difference]: With dead ends: 2108 [2019-09-08 10:48:10,292 INFO L226 Difference]: Without dead ends: 1688 [2019-09-08 10:48:10,303 INFO L628 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-09-08 10:48:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2019-09-08 10:48:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1684. [2019-09-08 10:48:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2019-09-08 10:48:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2318 transitions. [2019-09-08 10:48:10,367 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2318 transitions. Word has length 67 [2019-09-08 10:48:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:10,367 INFO L475 AbstractCegarLoop]: Abstraction has 1684 states and 2318 transitions. [2019-09-08 10:48:10,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2318 transitions. [2019-09-08 10:48:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:48:10,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:10,373 INFO L399 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] [2019-09-08 10:48:10,373 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2113210194, now seen corresponding path program 1 times [2019-09-08 10:48:10,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:10,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:10,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:10,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:10,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:10,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:10,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:10,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:10,565 INFO L87 Difference]: Start difference. First operand 1684 states and 2318 transitions. Second operand 6 states. [2019-09-08 10:48:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:11,483 INFO L93 Difference]: Finished difference Result 4418 states and 6248 transitions. [2019-09-08 10:48:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:11,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-08 10:48:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:11,501 INFO L225 Difference]: With dead ends: 4418 [2019-09-08 10:48:11,501 INFO L226 Difference]: Without dead ends: 2962 [2019-09-08 10:48:11,505 INFO L628 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-09-08 10:48:11,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-09-08 10:48:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2958. [2019-09-08 10:48:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-09-08 10:48:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 4186 transitions. [2019-09-08 10:48:11,631 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 4186 transitions. Word has length 67 [2019-09-08 10:48:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:11,632 INFO L475 AbstractCegarLoop]: Abstraction has 2958 states and 4186 transitions. [2019-09-08 10:48:11,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 4186 transitions. [2019-09-08 10:48:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:48:11,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:11,637 INFO L399 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] [2019-09-08 10:48:11,637 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:11,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:11,637 INFO L82 PathProgramCache]: Analyzing trace with hash -115367663, now seen corresponding path program 1 times [2019-09-08 10:48:11,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:11,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:11,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:11,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:11,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:11,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:11,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:11,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:11,717 INFO L87 Difference]: Start difference. First operand 2958 states and 4186 transitions. Second operand 3 states. [2019-09-08 10:48:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:11,895 INFO L93 Difference]: Finished difference Result 6482 states and 9299 transitions. [2019-09-08 10:48:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:11,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 10:48:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:11,916 INFO L225 Difference]: With dead ends: 6482 [2019-09-08 10:48:11,916 INFO L226 Difference]: Without dead ends: 4269 [2019-09-08 10:48:11,923 INFO L628 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-09-08 10:48:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states. [2019-09-08 10:48:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 4251. [2019-09-08 10:48:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4251 states. [2019-09-08 10:48:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 5986 transitions. [2019-09-08 10:48:12,162 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 5986 transitions. Word has length 68 [2019-09-08 10:48:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:12,164 INFO L475 AbstractCegarLoop]: Abstraction has 4251 states and 5986 transitions. [2019-09-08 10:48:12,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 5986 transitions. [2019-09-08 10:48:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:48:12,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:12,171 INFO L399 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] [2019-09-08 10:48:12,171 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -781567947, now seen corresponding path program 1 times [2019-09-08 10:48:12,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:12,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:12,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:12,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:12,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:12,325 INFO L87 Difference]: Start difference. First operand 4251 states and 5986 transitions. Second operand 6 states. [2019-09-08 10:48:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:13,134 INFO L93 Difference]: Finished difference Result 11934 states and 17028 transitions. [2019-09-08 10:48:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:13,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:48:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:13,174 INFO L225 Difference]: With dead ends: 11934 [2019-09-08 10:48:13,174 INFO L226 Difference]: Without dead ends: 8021 [2019-09-08 10:48:13,187 INFO L628 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-09-08 10:48:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8021 states. [2019-09-08 10:48:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8021 to 7973. [2019-09-08 10:48:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7973 states. [2019-09-08 10:48:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 11362 transitions. [2019-09-08 10:48:13,592 INFO L78 Accepts]: Start accepts. Automaton has 7973 states and 11362 transitions. Word has length 69 [2019-09-08 10:48:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:13,592 INFO L475 AbstractCegarLoop]: Abstraction has 7973 states and 11362 transitions. [2019-09-08 10:48:13,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7973 states and 11362 transitions. [2019-09-08 10:48:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:48:13,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:13,600 INFO L399 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-09-08 10:48:13,600 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:13,601 INFO L82 PathProgramCache]: Analyzing trace with hash 471461991, now seen corresponding path program 1 times [2019-09-08 10:48:13,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:13,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:13,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:13,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:13,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:13,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:13,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:48:13,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:48:13,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:48:13,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:48:13,697 INFO L87 Difference]: Start difference. First operand 7973 states and 11362 transitions. Second operand 5 states. [2019-09-08 10:48:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:14,625 INFO L93 Difference]: Finished difference Result 18895 states and 26988 transitions. [2019-09-08 10:48:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:14,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-08 10:48:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:14,678 INFO L225 Difference]: With dead ends: 18895 [2019-09-08 10:48:14,679 INFO L226 Difference]: Without dead ends: 11211 [2019-09-08 10:48:14,699 INFO L628 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-09-08 10:48:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11211 states. [2019-09-08 10:48:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11211 to 7973. [2019-09-08 10:48:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7973 states. [2019-09-08 10:48:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 11311 transitions. [2019-09-08 10:48:15,152 INFO L78 Accepts]: Start accepts. Automaton has 7973 states and 11311 transitions. Word has length 70 [2019-09-08 10:48:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:15,153 INFO L475 AbstractCegarLoop]: Abstraction has 7973 states and 11311 transitions. [2019-09-08 10:48:15,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:48:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7973 states and 11311 transitions. [2019-09-08 10:48:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:48:15,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:15,161 INFO L399 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-09-08 10:48:15,161 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:15,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:15,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1788309191, now seen corresponding path program 1 times [2019-09-08 10:48:15,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:15,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:15,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:15,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:15,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:15,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:15,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:48:15,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:48:15,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:48:15,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:48:15,361 INFO L87 Difference]: Start difference. First operand 7973 states and 11311 transitions. Second operand 7 states. [2019-09-08 10:48:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:17,340 INFO L93 Difference]: Finished difference Result 32047 states and 46491 transitions. [2019-09-08 10:48:17,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:48:17,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-08 10:48:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:17,422 INFO L225 Difference]: With dead ends: 32047 [2019-09-08 10:48:17,422 INFO L226 Difference]: Without dead ends: 29243 [2019-09-08 10:48:17,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:48:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29243 states. [2019-09-08 10:48:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29243 to 7997. [2019-09-08 10:48:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7997 states. [2019-09-08 10:48:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 11343 transitions. [2019-09-08 10:48:18,720 INFO L78 Accepts]: Start accepts. Automaton has 7997 states and 11343 transitions. Word has length 70 [2019-09-08 10:48:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:18,720 INFO L475 AbstractCegarLoop]: Abstraction has 7997 states and 11343 transitions. [2019-09-08 10:48:18,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:48:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 7997 states and 11343 transitions. [2019-09-08 10:48:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:48:18,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:18,727 INFO L399 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-09-08 10:48:18,728 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash 503690724, now seen corresponding path program 1 times [2019-09-08 10:48:18,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:18,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:18,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:18,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:18,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:18,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:18,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:48:18,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:48:18,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:48:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:48:18,836 INFO L87 Difference]: Start difference. First operand 7997 states and 11343 transitions. Second operand 7 states. [2019-09-08 10:48:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:21,144 INFO L93 Difference]: Finished difference Result 28536 states and 40889 transitions. [2019-09-08 10:48:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:48:21,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 10:48:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:21,203 INFO L225 Difference]: With dead ends: 28536 [2019-09-08 10:48:21,204 INFO L226 Difference]: Without dead ends: 25312 [2019-09-08 10:48:21,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:48:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25312 states. [2019-09-08 10:48:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25312 to 8025. [2019-09-08 10:48:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8025 states. [2019-09-08 10:48:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8025 states to 8025 states and 11379 transitions. [2019-09-08 10:48:22,024 INFO L78 Accepts]: Start accepts. Automaton has 8025 states and 11379 transitions. Word has length 71 [2019-09-08 10:48:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:22,024 INFO L475 AbstractCegarLoop]: Abstraction has 8025 states and 11379 transitions. [2019-09-08 10:48:22,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:48:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8025 states and 11379 transitions. [2019-09-08 10:48:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:48:22,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:22,031 INFO L399 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-09-08 10:48:22,031 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1290630934, now seen corresponding path program 1 times [2019-09-08 10:48:22,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:22,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:22,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:22,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:22,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:22,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:22,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:22,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:22,143 INFO L87 Difference]: Start difference. First operand 8025 states and 11379 transitions. Second operand 6 states. [2019-09-08 10:48:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:23,499 INFO L93 Difference]: Finished difference Result 24171 states and 34411 transitions. [2019-09-08 10:48:23,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:23,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:48:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:23,550 INFO L225 Difference]: With dead ends: 24171 [2019-09-08 10:48:23,550 INFO L226 Difference]: Without dead ends: 16458 [2019-09-08 10:48:23,571 INFO L628 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-09-08 10:48:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16458 states. [2019-09-08 10:48:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16458 to 16350. [2019-09-08 10:48:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16350 states. [2019-09-08 10:48:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16350 states to 16350 states and 23201 transitions. [2019-09-08 10:48:24,732 INFO L78 Accepts]: Start accepts. Automaton has 16350 states and 23201 transitions. Word has length 71 [2019-09-08 10:48:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:24,732 INFO L475 AbstractCegarLoop]: Abstraction has 16350 states and 23201 transitions. [2019-09-08 10:48:24,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 16350 states and 23201 transitions. [2019-09-08 10:48:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:48:24,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:24,741 INFO L399 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] [2019-09-08 10:48:24,741 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:24,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash 878384200, now seen corresponding path program 1 times [2019-09-08 10:48:24,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:24,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:24,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:24,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:24,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:48:24,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:48:24,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:48:24,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:48:24,845 INFO L87 Difference]: Start difference. First operand 16350 states and 23201 transitions. Second operand 7 states. [2019-09-08 10:48:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:30,420 INFO L93 Difference]: Finished difference Result 76894 states and 110537 transitions. [2019-09-08 10:48:30,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:48:30,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:48:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:30,663 INFO L225 Difference]: With dead ends: 76894 [2019-09-08 10:48:30,663 INFO L226 Difference]: Without dead ends: 68962 [2019-09-08 10:48:30,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:48:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68962 states. [2019-09-08 10:48:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68962 to 16447. [2019-09-08 10:48:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16447 states. [2019-09-08 10:48:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16447 states to 16447 states and 23330 transitions. [2019-09-08 10:48:32,333 INFO L78 Accepts]: Start accepts. Automaton has 16447 states and 23330 transitions. Word has length 72 [2019-09-08 10:48:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:32,333 INFO L475 AbstractCegarLoop]: Abstraction has 16447 states and 23330 transitions. [2019-09-08 10:48:32,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:48:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 16447 states and 23330 transitions. [2019-09-08 10:48:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:48:32,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:32,341 INFO L399 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-09-08 10:48:32,341 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:32,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1445608023, now seen corresponding path program 1 times [2019-09-08 10:48:32,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:32,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:32,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:32,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:32,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:48:32,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:48:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:48:32,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:48:32,535 INFO L87 Difference]: Start difference. First operand 16447 states and 23330 transitions. Second operand 9 states. [2019-09-08 10:48:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:40,010 INFO L93 Difference]: Finished difference Result 80249 states and 116723 transitions. [2019-09-08 10:48:40,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:48:40,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:48:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:40,122 INFO L225 Difference]: With dead ends: 80249 [2019-09-08 10:48:40,123 INFO L226 Difference]: Without dead ends: 67139 [2019-09-08 10:48:40,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:48:40,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67139 states. [2019-09-08 10:48:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67139 to 16443. [2019-09-08 10:48:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16443 states. [2019-09-08 10:48:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16443 states to 16443 states and 23322 transitions. [2019-09-08 10:48:42,005 INFO L78 Accepts]: Start accepts. Automaton has 16443 states and 23322 transitions. Word has length 73 [2019-09-08 10:48:42,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:42,005 INFO L475 AbstractCegarLoop]: Abstraction has 16443 states and 23322 transitions. [2019-09-08 10:48:42,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:48:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 16443 states and 23322 transitions. [2019-09-08 10:48:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:48:42,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:42,014 INFO L399 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-09-08 10:48:42,014 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash 185692076, now seen corresponding path program 1 times [2019-09-08 10:48:42,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:42,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:42,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:42,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:42,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:42,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:42,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:48:42,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:48:42,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:48:42,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:48:42,262 INFO L87 Difference]: Start difference. First operand 16443 states and 23322 transitions. Second operand 10 states. [2019-09-08 10:48:49,559 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-09-08 10:48:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:53,662 INFO L93 Difference]: Finished difference Result 90268 states and 130420 transitions. [2019-09-08 10:48:53,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:48:53,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-08 10:48:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:53,788 INFO L225 Difference]: With dead ends: 90268 [2019-09-08 10:48:53,789 INFO L226 Difference]: Without dead ends: 83789 [2019-09-08 10:48:53,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:48:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83789 states. [2019-09-08 10:48:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83789 to 16443. [2019-09-08 10:48:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16443 states. [2019-09-08 10:48:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16443 states to 16443 states and 23320 transitions. [2019-09-08 10:48:55,592 INFO L78 Accepts]: Start accepts. Automaton has 16443 states and 23320 transitions. Word has length 73 [2019-09-08 10:48:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:55,593 INFO L475 AbstractCegarLoop]: Abstraction has 16443 states and 23320 transitions. [2019-09-08 10:48:55,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:48:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 16443 states and 23320 transitions. [2019-09-08 10:48:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:48:55,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:55,600 INFO L399 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-09-08 10:48:55,601 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:55,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:55,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1531312438, now seen corresponding path program 1 times [2019-09-08 10:48:55,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:55,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:55,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:55,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:55,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:56,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:56,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:48:56,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:48:56,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:48:56,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:48:56,089 INFO L87 Difference]: Start difference. First operand 16443 states and 23320 transitions. Second operand 12 states. [2019-09-08 10:49:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:08,599 INFO L93 Difference]: Finished difference Result 102820 states and 149384 transitions. [2019-09-08 10:49:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:49:08,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 10:49:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:08,706 INFO L225 Difference]: With dead ends: 102820 [2019-09-08 10:49:08,706 INFO L226 Difference]: Without dead ends: 89686 [2019-09-08 10:49:08,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:49:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89686 states. [2019-09-08 10:49:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89686 to 16411. [2019-09-08 10:49:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16411 states. [2019-09-08 10:49:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16411 states to 16411 states and 23278 transitions. [2019-09-08 10:49:10,944 INFO L78 Accepts]: Start accepts. Automaton has 16411 states and 23278 transitions. Word has length 74 [2019-09-08 10:49:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:10,945 INFO L475 AbstractCegarLoop]: Abstraction has 16411 states and 23278 transitions. [2019-09-08 10:49:10,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:49:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 16411 states and 23278 transitions. [2019-09-08 10:49:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:49:10,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:10,951 INFO L399 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-09-08 10:49:10,951 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1383262957, now seen corresponding path program 1 times [2019-09-08 10:49:10,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:10,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:10,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:10,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:10,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:11,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:11,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:49:11,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:49:11,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:49:11,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:49:11,154 INFO L87 Difference]: Start difference. First operand 16411 states and 23278 transitions. Second operand 9 states. [2019-09-08 10:49:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:22,981 INFO L93 Difference]: Finished difference Result 80270 states and 116760 transitions. [2019-09-08 10:49:22,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:49:22,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-08 10:49:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:23,062 INFO L225 Difference]: With dead ends: 80270 [2019-09-08 10:49:23,062 INFO L226 Difference]: Without dead ends: 67110 [2019-09-08 10:49:23,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:49:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67110 states. [2019-09-08 10:49:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67110 to 16383. [2019-09-08 10:49:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16383 states. [2019-09-08 10:49:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16383 states to 16383 states and 23234 transitions. [2019-09-08 10:49:25,584 INFO L78 Accepts]: Start accepts. Automaton has 16383 states and 23234 transitions. Word has length 74 [2019-09-08 10:49:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:25,584 INFO L475 AbstractCegarLoop]: Abstraction has 16383 states and 23234 transitions. [2019-09-08 10:49:25,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:49:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 16383 states and 23234 transitions. [2019-09-08 10:49:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:49:25,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:25,590 INFO L399 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-09-08 10:49:25,590 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1378132539, now seen corresponding path program 1 times [2019-09-08 10:49:25,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:25,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:25,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:25,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:25,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:25,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:25,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:49:25,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:49:25,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:49:25,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:49:25,707 INFO L87 Difference]: Start difference. First operand 16383 states and 23234 transitions. Second operand 7 states. [2019-09-08 10:49:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:36,000 INFO L93 Difference]: Finished difference Result 66957 states and 96050 transitions. [2019-09-08 10:49:36,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:49:36,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:49:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:36,073 INFO L225 Difference]: With dead ends: 66957 [2019-09-08 10:49:36,074 INFO L226 Difference]: Without dead ends: 59217 [2019-09-08 10:49:36,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:49:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59217 states. [2019-09-08 10:49:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59217 to 16471. [2019-09-08 10:49:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16471 states. [2019-09-08 10:49:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16471 states to 16471 states and 23355 transitions. [2019-09-08 10:49:39,674 INFO L78 Accepts]: Start accepts. Automaton has 16471 states and 23355 transitions. Word has length 74 [2019-09-08 10:49:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:39,674 INFO L475 AbstractCegarLoop]: Abstraction has 16471 states and 23355 transitions. [2019-09-08 10:49:39,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:49:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 16471 states and 23355 transitions. [2019-09-08 10:49:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:49:39,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:39,680 INFO L399 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-09-08 10:49:39,680 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1178441383, now seen corresponding path program 1 times [2019-09-08 10:49:39,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:39,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:39,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:39,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:39,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:40,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-09-08 10:49:40,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:40,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:49:40,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:49:40,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:49:40,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:49:40,051 INFO L87 Difference]: Start difference. First operand 16471 states and 23355 transitions. Second operand 12 states. [2019-09-08 10:49:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:56,745 INFO L93 Difference]: Finished difference Result 103448 states and 150122 transitions. [2019-09-08 10:49:56,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:49:56,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 10:49:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:56,862 INFO L225 Difference]: With dead ends: 103448 [2019-09-08 10:49:56,862 INFO L226 Difference]: Without dead ends: 90130 [2019-09-08 10:49:56,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:49:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90130 states. [2019-09-08 10:49:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90130 to 16247. [2019-09-08 10:49:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16247 states. [2019-09-08 10:49:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16247 states to 16247 states and 23075 transitions. [2019-09-08 10:49:59,944 INFO L78 Accepts]: Start accepts. Automaton has 16247 states and 23075 transitions. Word has length 74 [2019-09-08 10:49:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:59,944 INFO L475 AbstractCegarLoop]: Abstraction has 16247 states and 23075 transitions. [2019-09-08 10:49:59,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:49:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 16247 states and 23075 transitions. [2019-09-08 10:49:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:49:59,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:59,950 INFO L399 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] [2019-09-08 10:49:59,951 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash -675118073, now seen corresponding path program 1 times [2019-09-08 10:49:59,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:59,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:59,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:00,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:00,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:50:00,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:50:00,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:50:00,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:50:00,057 INFO L87 Difference]: Start difference. First operand 16247 states and 23075 transitions. Second operand 7 states. [2019-09-08 10:50:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:12,770 INFO L93 Difference]: Finished difference Result 66665 states and 95698 transitions. [2019-09-08 10:50:12,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:50:12,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-08 10:50:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:12,850 INFO L225 Difference]: With dead ends: 66665 [2019-09-08 10:50:12,851 INFO L226 Difference]: Without dead ends: 58949 [2019-09-08 10:50:12,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:50:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58949 states. [2019-09-08 10:50:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58949 to 16290. [2019-09-08 10:50:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16290 states. [2019-09-08 10:50:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16290 states to 16290 states and 23136 transitions. [2019-09-08 10:50:15,873 INFO L78 Accepts]: Start accepts. Automaton has 16290 states and 23136 transitions. Word has length 75 [2019-09-08 10:50:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:15,874 INFO L475 AbstractCegarLoop]: Abstraction has 16290 states and 23136 transitions. [2019-09-08 10:50:15,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:50:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16290 states and 23136 transitions. [2019-09-08 10:50:15,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:50:15,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:15,880 INFO L399 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] [2019-09-08 10:50:15,880 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:15,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1666989368, now seen corresponding path program 1 times [2019-09-08 10:50:15,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:15,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:15,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:15,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:16,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:16,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:50:16,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:50:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:50:16,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:50:16,358 INFO L87 Difference]: Start difference. First operand 16290 states and 23136 transitions. Second operand 13 states. [2019-09-08 10:50:17,151 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 10:50:17,361 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 10:50:17,576 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 10:50:17,820 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 10:50:18,091 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 10:50:18,595 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:50:19,180 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 10:50:23,360 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 10:50:25,661 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 10:50:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:40,228 INFO L93 Difference]: Finished difference Result 103760 states and 149684 transitions. [2019-09-08 10:50:40,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:50:40,229 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2019-09-08 10:50:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:40,346 INFO L225 Difference]: With dead ends: 103760 [2019-09-08 10:50:40,346 INFO L226 Difference]: Without dead ends: 95896 [2019-09-08 10:50:40,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 10:50:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95896 states. [2019-09-08 10:50:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95896 to 16258. [2019-09-08 10:50:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16258 states. [2019-09-08 10:50:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16258 states to 16258 states and 23092 transitions. [2019-09-08 10:50:44,358 INFO L78 Accepts]: Start accepts. Automaton has 16258 states and 23092 transitions. Word has length 75 [2019-09-08 10:50:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:44,359 INFO L475 AbstractCegarLoop]: Abstraction has 16258 states and 23092 transitions. [2019-09-08 10:50:44,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:50:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 16258 states and 23092 transitions. [2019-09-08 10:50:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:50:44,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:44,366 INFO L399 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] [2019-09-08 10:50:44,366 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1354273678, now seen corresponding path program 1 times [2019-09-08 10:50:44,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:44,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:44,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:44,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:44,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:50:44,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:50:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:50:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:50:44,465 INFO L87 Difference]: Start difference. First operand 16258 states and 23092 transitions. Second operand 7 states. [2019-09-08 10:51:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:02,574 INFO L93 Difference]: Finished difference Result 76369 states and 109909 transitions. [2019-09-08 10:51:02,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:51:02,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-08 10:51:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:02,659 INFO L225 Difference]: With dead ends: 76369 [2019-09-08 10:51:02,659 INFO L226 Difference]: Without dead ends: 68579 [2019-09-08 10:51:02,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:51:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68579 states. [2019-09-08 10:51:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68579 to 16288. [2019-09-08 10:51:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16288 states. [2019-09-08 10:51:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16288 states to 16288 states and 23132 transitions. [2019-09-08 10:51:06,529 INFO L78 Accepts]: Start accepts. Automaton has 16288 states and 23132 transitions. Word has length 75 [2019-09-08 10:51:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:06,529 INFO L475 AbstractCegarLoop]: Abstraction has 16288 states and 23132 transitions. [2019-09-08 10:51:06,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:51:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 16288 states and 23132 transitions. [2019-09-08 10:51:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:51:06,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:06,536 INFO L399 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] [2019-09-08 10:51:06,536 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:06,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 869290451, now seen corresponding path program 1 times [2019-09-08 10:51:06,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:06,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:06,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:06,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:06,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:06,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:51:06,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:51:06,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:51:06,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:51:06,736 INFO L87 Difference]: Start difference. First operand 16288 states and 23132 transitions. Second operand 10 states. [2019-09-08 10:51:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:26,369 INFO L93 Difference]: Finished difference Result 83009 states and 120013 transitions. [2019-09-08 10:51:26,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:51:26,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-09-08 10:51:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:26,449 INFO L225 Difference]: With dead ends: 83009 [2019-09-08 10:51:26,449 INFO L226 Difference]: Without dead ends: 69563 [2019-09-08 10:51:26,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-09-08 10:51:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69563 states. [2019-09-08 10:51:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69563 to 16102. [2019-09-08 10:51:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-09-08 10:51:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 22891 transitions. [2019-09-08 10:51:30,527 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 22891 transitions. Word has length 75 [2019-09-08 10:51:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:30,528 INFO L475 AbstractCegarLoop]: Abstraction has 16102 states and 22891 transitions. [2019-09-08 10:51:30,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:51:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 22891 transitions. [2019-09-08 10:51:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:51:30,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:30,533 INFO L399 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-09-08 10:51:30,534 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:30,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:30,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1936163638, now seen corresponding path program 1 times [2019-09-08 10:51:30,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:30,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:30,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:30,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:30,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:30,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:30,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:51:30,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:51:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:51:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:51:30,740 INFO L87 Difference]: Start difference. First operand 16102 states and 22891 transitions. Second operand 10 states. [2019-09-08 10:52:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:00,508 INFO L93 Difference]: Finished difference Result 110242 states and 159919 transitions. [2019-09-08 10:52:00,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:52:00,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-09-08 10:52:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:00,631 INFO L225 Difference]: With dead ends: 110242 [2019-09-08 10:52:00,632 INFO L226 Difference]: Without dead ends: 96750 [2019-09-08 10:52:00,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:52:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96750 states. [2019-09-08 10:52:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96750 to 16102. [2019-09-08 10:52:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-09-08 10:52:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 22889 transitions. [2019-09-08 10:52:05,181 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 22889 transitions. Word has length 76 [2019-09-08 10:52:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:05,182 INFO L475 AbstractCegarLoop]: Abstraction has 16102 states and 22889 transitions. [2019-09-08 10:52:05,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:52:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 22889 transitions. [2019-09-08 10:52:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:52:05,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:05,187 INFO L399 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-09-08 10:52:05,187 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:05,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:05,187 INFO L82 PathProgramCache]: Analyzing trace with hash -16696217, now seen corresponding path program 1 times [2019-09-08 10:52:05,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:05,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:05,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:05,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:05,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:05,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:05,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:05,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:05,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:05,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:05,260 INFO L87 Difference]: Start difference. First operand 16102 states and 22889 transitions. Second operand 3 states. [2019-09-08 10:52:09,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:09,677 INFO L93 Difference]: Finished difference Result 24221 states and 34556 transitions. [2019-09-08 10:52:09,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:09,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:52:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:09,693 INFO L225 Difference]: With dead ends: 24221 [2019-09-08 10:52:09,693 INFO L226 Difference]: Without dead ends: 16106 [2019-09-08 10:52:09,703 INFO L628 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-09-08 10:52:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16106 states. [2019-09-08 10:52:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16106 to 16102. [2019-09-08 10:52:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-09-08 10:52:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 22651 transitions. [2019-09-08 10:52:13,741 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 22651 transitions. Word has length 76 [2019-09-08 10:52:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:13,741 INFO L475 AbstractCegarLoop]: Abstraction has 16102 states and 22651 transitions. [2019-09-08 10:52:13,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 22651 transitions. [2019-09-08 10:52:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:52:13,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:13,746 INFO L399 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-09-08 10:52:13,746 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1575765556, now seen corresponding path program 1 times [2019-09-08 10:52:13,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:13,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:13,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:13,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:13,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:13,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:13,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:13,796 INFO L87 Difference]: Start difference. First operand 16102 states and 22651 transitions. Second operand 3 states. [2019-09-08 10:52:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:20,265 INFO L93 Difference]: Finished difference Result 32167 states and 45630 transitions. [2019-09-08 10:52:20,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:20,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:52:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:20,291 INFO L225 Difference]: With dead ends: 32167 [2019-09-08 10:52:20,291 INFO L226 Difference]: Without dead ends: 23321 [2019-09-08 10:52:20,301 INFO L628 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-09-08 10:52:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23321 states. [2019-09-08 10:52:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23321 to 18457. [2019-09-08 10:52:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18457 states. [2019-09-08 10:52:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18457 states to 18457 states and 26157 transitions. [2019-09-08 10:52:26,874 INFO L78 Accepts]: Start accepts. Automaton has 18457 states and 26157 transitions. Word has length 76 [2019-09-08 10:52:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:26,874 INFO L475 AbstractCegarLoop]: Abstraction has 18457 states and 26157 transitions. [2019-09-08 10:52:26,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 18457 states and 26157 transitions. [2019-09-08 10:52:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:52:26,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:26,878 INFO L399 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-09-08 10:52:26,878 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:26,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:26,879 INFO L82 PathProgramCache]: Analyzing trace with hash 843711097, now seen corresponding path program 1 times [2019-09-08 10:52:26,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:26,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:26,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:26,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:26,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:27,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:27,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:52:27,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:52:27,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:52:27,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:52:27,435 INFO L87 Difference]: Start difference. First operand 18457 states and 26157 transitions. Second operand 12 states. [2019-09-08 10:52:28,113 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-08 10:52:28,331 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 10:52:28,579 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 10:52:28,823 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 10:52:29,033 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 10:52:29,502 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-08 10:52:29,991 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 10:52:33,020 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 10:52:33,934 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 10:52:34,810 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 10:52:35,749 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 10:52:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:46,672 INFO L93 Difference]: Finished difference Result 48490 states and 68987 transitions. [2019-09-08 10:52:46,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:52:46,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2019-09-08 10:52:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:46,726 INFO L225 Difference]: With dead ends: 48490 [2019-09-08 10:52:46,726 INFO L226 Difference]: Without dead ends: 44617 [2019-09-08 10:52:46,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2019-09-08 10:52:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44617 states. [2019-09-08 10:52:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44617 to 18448. [2019-09-08 10:52:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18448 states. [2019-09-08 10:52:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 26146 transitions. [2019-09-08 10:52:52,532 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 26146 transitions. Word has length 76 [2019-09-08 10:52:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:52,533 INFO L475 AbstractCegarLoop]: Abstraction has 18448 states and 26146 transitions. [2019-09-08 10:52:52,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:52:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 26146 transitions. [2019-09-08 10:52:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:52:52,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:52,539 INFO L399 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-09-08 10:52:52,539 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:52,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1246526496, now seen corresponding path program 1 times [2019-09-08 10:52:52,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:52,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:52,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:52,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:52,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:52,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:52,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:52,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:52,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:52,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:52,597 INFO L87 Difference]: Start difference. First operand 18448 states and 26146 transitions. Second operand 3 states. [2019-09-08 10:52:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:58,557 INFO L93 Difference]: Finished difference Result 28151 states and 39979 transitions. [2019-09-08 10:52:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:58,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:52:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:58,576 INFO L225 Difference]: With dead ends: 28151 [2019-09-08 10:52:58,576 INFO L226 Difference]: Without dead ends: 18450 [2019-09-08 10:52:58,585 INFO L628 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-09-08 10:52:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18450 states. [2019-09-08 10:53:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18450 to 18448. [2019-09-08 10:53:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18448 states. [2019-09-08 10:53:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 25890 transitions. [2019-09-08 10:53:04,211 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 25890 transitions. Word has length 77 [2019-09-08 10:53:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:04,212 INFO L475 AbstractCegarLoop]: Abstraction has 18448 states and 25890 transitions. [2019-09-08 10:53:04,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:53:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 25890 transitions. [2019-09-08 10:53:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:53:04,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:04,216 INFO L399 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-09-08 10:53:04,216 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:04,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:04,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1512534225, now seen corresponding path program 1 times [2019-09-08 10:53:04,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:04,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:04,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:04,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:04,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:04,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:04,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:53:04,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:53:04,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:53:04,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:53:04,272 INFO L87 Difference]: Start difference. First operand 18448 states and 25890 transitions. Second operand 3 states. [2019-09-08 10:53:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:10,137 INFO L93 Difference]: Finished difference Result 26409 states and 37022 transitions. [2019-09-08 10:53:10,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:53:10,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:53:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:10,160 INFO L225 Difference]: With dead ends: 26409 [2019-09-08 10:53:10,161 INFO L226 Difference]: Without dead ends: 18117 [2019-09-08 10:53:10,171 INFO L628 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-09-08 10:53:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18117 states. [2019-09-08 10:53:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18117 to 18115. [2019-09-08 10:53:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18115 states. [2019-09-08 10:53:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18115 states to 18115 states and 25172 transitions. [2019-09-08 10:53:15,792 INFO L78 Accepts]: Start accepts. Automaton has 18115 states and 25172 transitions. Word has length 77 [2019-09-08 10:53:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:15,792 INFO L475 AbstractCegarLoop]: Abstraction has 18115 states and 25172 transitions. [2019-09-08 10:53:15,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:53:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 18115 states and 25172 transitions. [2019-09-08 10:53:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:53:15,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:15,796 INFO L399 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-09-08 10:53:15,797 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:15,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash 54165991, now seen corresponding path program 1 times [2019-09-08 10:53:15,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:15,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:15,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:15,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:15,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:15,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:15,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:53:15,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:53:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:53:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:53:15,946 INFO L87 Difference]: Start difference. First operand 18115 states and 25172 transitions. Second operand 9 states. [2019-09-08 10:53:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:32,105 INFO L93 Difference]: Finished difference Result 45713 states and 64180 transitions. [2019-09-08 10:53:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:53:32,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 10:53:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:32,152 INFO L225 Difference]: With dead ends: 45713 [2019-09-08 10:53:32,153 INFO L226 Difference]: Without dead ends: 44287 [2019-09-08 10:53:32,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:53:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44287 states. [2019-09-08 10:53:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44287 to 18111. [2019-09-08 10:53:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18111 states. [2019-09-08 10:53:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18111 states to 18111 states and 25164 transitions. [2019-09-08 10:53:38,143 INFO L78 Accepts]: Start accepts. Automaton has 18111 states and 25164 transitions. Word has length 78 [2019-09-08 10:53:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:38,144 INFO L475 AbstractCegarLoop]: Abstraction has 18111 states and 25164 transitions. [2019-09-08 10:53:38,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:53:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 18111 states and 25164 transitions. [2019-09-08 10:53:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:53:38,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:38,149 INFO L399 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-09-08 10:53:38,149 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash -246734376, now seen corresponding path program 1 times [2019-09-08 10:53:38,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:38,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:38,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:38,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:38,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:38,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:38,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:53:38,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:53:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:53:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:53:38,300 INFO L87 Difference]: Start difference. First operand 18111 states and 25164 transitions. Second operand 9 states. [2019-09-08 10:53:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:58,150 INFO L93 Difference]: Finished difference Result 50532 states and 71001 transitions. [2019-09-08 10:53:58,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:53:58,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 10:53:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:58,205 INFO L225 Difference]: With dead ends: 50532 [2019-09-08 10:53:58,206 INFO L226 Difference]: Without dead ends: 49102 [2019-09-08 10:53:58,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:53:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49102 states. [2019-09-08 10:54:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49102 to 18111. [2019-09-08 10:54:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18111 states. [2019-09-08 10:54:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18111 states to 18111 states and 25162 transitions. [2019-09-08 10:54:04,278 INFO L78 Accepts]: Start accepts. Automaton has 18111 states and 25162 transitions. Word has length 78 [2019-09-08 10:54:04,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:04,279 INFO L475 AbstractCegarLoop]: Abstraction has 18111 states and 25162 transitions. [2019-09-08 10:54:04,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:54:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18111 states and 25162 transitions. [2019-09-08 10:54:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:54:04,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:04,283 INFO L399 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-09-08 10:54:04,283 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:04,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1310156377, now seen corresponding path program 1 times [2019-09-08 10:54:04,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:04,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:04,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:04,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:04,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:04,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:54:04,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:54:04,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:54:04,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:54:04,331 INFO L87 Difference]: Start difference. First operand 18111 states and 25162 transitions. Second operand 3 states. [2019-09-08 10:54:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:13,541 INFO L93 Difference]: Finished difference Result 37209 states and 52110 transitions. [2019-09-08 10:54:13,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:54:13,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:54:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:13,572 INFO L225 Difference]: With dead ends: 37209 [2019-09-08 10:54:13,572 INFO L226 Difference]: Without dead ends: 26991 [2019-09-08 10:54:13,584 INFO L628 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-09-08 10:54:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26991 states. [2019-09-08 10:54:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26991 to 17813. [2019-09-08 10:54:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17813 states. [2019-09-08 10:54:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17813 states to 17813 states and 24735 transitions. [2019-09-08 10:54:20,669 INFO L78 Accepts]: Start accepts. Automaton has 17813 states and 24735 transitions. Word has length 78 [2019-09-08 10:54:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:20,669 INFO L475 AbstractCegarLoop]: Abstraction has 17813 states and 24735 transitions. [2019-09-08 10:54:20,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:54:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17813 states and 24735 transitions. [2019-09-08 10:54:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:54:20,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:20,675 INFO L399 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-09-08 10:54:20,675 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:20,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1823471132, now seen corresponding path program 1 times [2019-09-08 10:54:20,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:20,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:20,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:20,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:20,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:54:20,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:54:20,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:54:20,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:54:20,727 INFO L87 Difference]: Start difference. First operand 17813 states and 24735 transitions. Second operand 3 states. [2019-09-08 10:54:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:31,539 INFO L93 Difference]: Finished difference Result 36740 states and 51415 transitions. [2019-09-08 10:54:31,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:54:31,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:54:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:31,570 INFO L225 Difference]: With dead ends: 36740 [2019-09-08 10:54:31,570 INFO L226 Difference]: Without dead ends: 26634 [2019-09-08 10:54:31,582 INFO L628 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-09-08 10:54:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-09-08 10:54:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 17458. [2019-09-08 10:54:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17458 states. [2019-09-08 10:54:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17458 states to 17458 states and 24251 transitions. [2019-09-08 10:54:40,040 INFO L78 Accepts]: Start accepts. Automaton has 17458 states and 24251 transitions. Word has length 78 [2019-09-08 10:54:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:40,041 INFO L475 AbstractCegarLoop]: Abstraction has 17458 states and 24251 transitions. [2019-09-08 10:54:40,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:54:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 17458 states and 24251 transitions. [2019-09-08 10:54:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:54:40,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:40,045 INFO L399 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] [2019-09-08 10:54:40,045 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash 942311866, now seen corresponding path program 1 times [2019-09-08 10:54:40,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:40,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:40,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:40,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:54:40,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:54:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:54:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:54:40,182 INFO L87 Difference]: Start difference. First operand 17458 states and 24251 transitions. Second operand 9 states. [2019-09-08 10:54:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:57,736 INFO L93 Difference]: Finished difference Result 35606 states and 49804 transitions. [2019-09-08 10:54:57,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:54:57,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 10:54:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:57,771 INFO L225 Difference]: With dead ends: 35606 [2019-09-08 10:54:57,771 INFO L226 Difference]: Without dead ends: 32104 [2019-09-08 10:54:57,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:54:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32104 states. [2019-09-08 10:55:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32104 to 17435. [2019-09-08 10:55:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17435 states. [2019-09-08 10:55:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17435 states to 17435 states and 24221 transitions. [2019-09-08 10:55:06,459 INFO L78 Accepts]: Start accepts. Automaton has 17435 states and 24221 transitions. Word has length 79 [2019-09-08 10:55:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:06,460 INFO L475 AbstractCegarLoop]: Abstraction has 17435 states and 24221 transitions. [2019-09-08 10:55:06,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:55:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 17435 states and 24221 transitions. [2019-09-08 10:55:06,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:55:06,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:06,464 INFO L399 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] [2019-09-08 10:55:06,464 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:06,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:06,465 INFO L82 PathProgramCache]: Analyzing trace with hash -399904747, now seen corresponding path program 1 times [2019-09-08 10:55:06,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:06,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:06,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:06,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:06,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:06,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:06,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:55:06,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:55:06,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:55:06,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:06,524 INFO L87 Difference]: Start difference. First operand 17435 states and 24221 transitions. Second operand 3 states. [2019-09-08 10:55:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:15,984 INFO L93 Difference]: Finished difference Result 25239 states and 34997 transitions. [2019-09-08 10:55:15,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:55:15,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 10:55:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:16,003 INFO L225 Difference]: With dead ends: 25239 [2019-09-08 10:55:16,003 INFO L226 Difference]: Without dead ends: 17403 [2019-09-08 10:55:16,012 INFO L628 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-09-08 10:55:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2019-09-08 10:55:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 14671. [2019-09-08 10:55:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14671 states. [2019-09-08 10:55:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14671 states to 14671 states and 20042 transitions. [2019-09-08 10:55:23,306 INFO L78 Accepts]: Start accepts. Automaton has 14671 states and 20042 transitions. Word has length 79 [2019-09-08 10:55:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:23,307 INFO L475 AbstractCegarLoop]: Abstraction has 14671 states and 20042 transitions. [2019-09-08 10:55:23,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:55:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 14671 states and 20042 transitions. [2019-09-08 10:55:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:55:23,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:23,313 INFO L399 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] [2019-09-08 10:55:23,313 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:23,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1296925749, now seen corresponding path program 1 times [2019-09-08 10:55:23,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:23,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:23,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:23,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:23,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:23,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:23,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:55:23,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:55:23,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:55:23,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:55:23,453 INFO L87 Difference]: Start difference. First operand 14671 states and 20042 transitions. Second operand 9 states. [2019-09-08 10:55:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:44,828 INFO L93 Difference]: Finished difference Result 37227 states and 51390 transitions. [2019-09-08 10:55:44,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:55:44,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 10:55:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:44,864 INFO L225 Difference]: With dead ends: 37227 [2019-09-08 10:55:44,865 INFO L226 Difference]: Without dead ends: 36737 [2019-09-08 10:55:44,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:55:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36737 states. [2019-09-08 10:55:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36737 to 14671. [2019-09-08 10:55:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14671 states. [2019-09-08 10:55:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14671 states to 14671 states and 20040 transitions. [2019-09-08 10:55:52,450 INFO L78 Accepts]: Start accepts. Automaton has 14671 states and 20040 transitions. Word has length 79 [2019-09-08 10:55:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:52,450 INFO L475 AbstractCegarLoop]: Abstraction has 14671 states and 20040 transitions. [2019-09-08 10:55:52,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:55:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 14671 states and 20040 transitions. [2019-09-08 10:55:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:55:52,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:52,454 INFO L399 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] [2019-09-08 10:55:52,454 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash -774477418, now seen corresponding path program 1 times [2019-09-08 10:55:52,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:52,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:52,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:52,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:52,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:52,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:52,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:55:52,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:55:52,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:55:52,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:55:52,583 INFO L87 Difference]: Start difference. First operand 14671 states and 20040 transitions. Second operand 9 states. [2019-09-08 10:56:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:07,717 INFO L93 Difference]: Finished difference Result 25352 states and 34836 transitions. [2019-09-08 10:56:07,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:56:07,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 10:56:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:07,746 INFO L225 Difference]: With dead ends: 25352 [2019-09-08 10:56:07,746 INFO L226 Difference]: Without dead ends: 24832 [2019-09-08 10:56:07,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:56:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24832 states. [2019-09-08 10:56:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24832 to 14671. [2019-09-08 10:56:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14671 states. [2019-09-08 10:56:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14671 states to 14671 states and 20038 transitions. [2019-09-08 10:56:15,433 INFO L78 Accepts]: Start accepts. Automaton has 14671 states and 20038 transitions. Word has length 79 [2019-09-08 10:56:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:15,433 INFO L475 AbstractCegarLoop]: Abstraction has 14671 states and 20038 transitions. [2019-09-08 10:56:15,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:56:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14671 states and 20038 transitions. [2019-09-08 10:56:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:56:15,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:15,438 INFO L399 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-09-08 10:56:15,438 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:15,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1684566900, now seen corresponding path program 1 times [2019-09-08 10:56:15,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:15,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:15,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:56:16,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:16,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 10:56:16,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 10:56:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 10:56:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:56:16,781 INFO L87 Difference]: Start difference. First operand 14671 states and 20038 transitions. Second operand 22 states. [2019-09-08 10:56:17,913 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-08 10:56:18,177 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-08 10:56:18,544 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-08 10:56:19,057 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-09-08 10:56:19,373 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-08 10:56:19,835 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-08 10:56:20,181 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-08 10:56:20,553 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-08 10:56:20,859 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-08 10:56:21,183 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-08 10:56:22,088 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-08 10:56:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:41,460 INFO L93 Difference]: Finished difference Result 32229 states and 44424 transitions. [2019-09-08 10:56:41,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 10:56:41,460 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2019-09-08 10:56:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:41,495 INFO L225 Difference]: With dead ends: 32229 [2019-09-08 10:56:41,495 INFO L226 Difference]: Without dead ends: 31733 [2019-09-08 10:56:41,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=398, Invalid=1324, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 10:56:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31733 states. [2019-09-08 10:56:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31733 to 14663. [2019-09-08 10:56:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14663 states. [2019-09-08 10:56:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14663 states to 14663 states and 20024 transitions. [2019-09-08 10:56:49,520 INFO L78 Accepts]: Start accepts. Automaton has 14663 states and 20024 transitions. Word has length 81 [2019-09-08 10:56:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:49,520 INFO L475 AbstractCegarLoop]: Abstraction has 14663 states and 20024 transitions. [2019-09-08 10:56:49,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 10:56:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 14663 states and 20024 transitions. [2019-09-08 10:56:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:56:49,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:49,526 INFO L399 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] [2019-09-08 10:56:49,526 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:49,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1922309466, now seen corresponding path program 1 times [2019-09-08 10:56:49,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:49,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:49,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:49,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:49,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:50,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-09-08 10:56:50,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:50,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 10:56:50,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 10:56:50,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 10:56:50,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:56:50,335 INFO L87 Difference]: Start difference. First operand 14663 states and 20024 transitions. Second operand 18 states. [2019-09-08 10:56:51,035 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-08 10:56:51,234 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 10:56:51,513 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 10:56:51,763 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 10:56:52,060 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 10:56:52,426 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 10:56:52,710 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 10:56:52,902 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 10:57:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:10,025 INFO L93 Difference]: Finished difference Result 29832 states and 41029 transitions. [2019-09-08 10:57:10,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 10:57:10,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2019-09-08 10:57:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:10,054 INFO L225 Difference]: With dead ends: 29832 [2019-09-08 10:57:10,054 INFO L226 Difference]: Without dead ends: 28623 [2019-09-08 10:57:10,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 10:57:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28623 states. [2019-09-08 10:57:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28623 to 14632. [2019-09-08 10:57:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14632 states. [2019-09-08 10:57:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14632 states to 14632 states and 19987 transitions. [2019-09-08 10:57:18,018 INFO L78 Accepts]: Start accepts. Automaton has 14632 states and 19987 transitions. Word has length 82 [2019-09-08 10:57:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:18,018 INFO L475 AbstractCegarLoop]: Abstraction has 14632 states and 19987 transitions. [2019-09-08 10:57:18,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 10:57:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 14632 states and 19987 transitions. [2019-09-08 10:57:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:57:18,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:18,024 INFO L399 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] [2019-09-08 10:57:18,025 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1311989212, now seen corresponding path program 1 times [2019-09-08 10:57:18,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:18,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:18,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:18,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-09-08 10:57:18,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:18,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:57:18,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:57:18,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:57:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:57:18,713 INFO L87 Difference]: Start difference. First operand 14632 states and 19987 transitions. Second operand 14 states. [2019-09-08 10:57:19,175 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 10:57:19,354 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 10:57:19,568 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 10:57:19,882 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-08 10:57:20,127 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 10:57:20,432 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 10:57:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:40,941 INFO L93 Difference]: Finished difference Result 32452 states and 44645 transitions. [2019-09-08 10:57:40,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:57:40,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 82 [2019-09-08 10:57:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:40,974 INFO L225 Difference]: With dead ends: 32452 [2019-09-08 10:57:40,975 INFO L226 Difference]: Without dead ends: 31922 [2019-09-08 10:57:40,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:57:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31922 states. [2019-09-08 10:57:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31922 to 14588. [2019-09-08 10:57:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14588 states. [2019-09-08 10:57:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14588 states to 14588 states and 19931 transitions. [2019-09-08 10:57:49,349 INFO L78 Accepts]: Start accepts. Automaton has 14588 states and 19931 transitions. Word has length 82 [2019-09-08 10:57:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:49,349 INFO L475 AbstractCegarLoop]: Abstraction has 14588 states and 19931 transitions. [2019-09-08 10:57:49,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:57:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 14588 states and 19931 transitions. [2019-09-08 10:57:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:57:49,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:49,354 INFO L399 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] [2019-09-08 10:57:49,354 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1478063430, now seen corresponding path program 1 times [2019-09-08 10:57:49,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:49,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:49,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:49,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:49,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:50,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:50,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 10:57:50,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 10:57:50,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 10:57:50,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:57:50,080 INFO L87 Difference]: Start difference. First operand 14588 states and 19931 transitions. Second operand 17 states. [2019-09-08 10:57:50,607 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 10:57:50,974 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 10:57:51,172 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-08 10:57:51,337 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:57:51,527 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:57:51,885 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 10:57:52,066 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:57:52,317 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:58:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:10,224 INFO L93 Difference]: Finished difference Result 27818 states and 38008 transitions. [2019-09-08 10:58:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:58:10,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2019-09-08 10:58:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:10,250 INFO L225 Difference]: With dead ends: 27818 [2019-09-08 10:58:10,251 INFO L226 Difference]: Without dead ends: 27278 [2019-09-08 10:58:10,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 10:58:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27278 states. [2019-09-08 10:58:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27278 to 14534. [2019-09-08 10:58:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14534 states. [2019-09-08 10:58:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14534 states to 14534 states and 19866 transitions. [2019-09-08 10:58:18,816 INFO L78 Accepts]: Start accepts. Automaton has 14534 states and 19866 transitions. Word has length 82 [2019-09-08 10:58:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:18,816 INFO L475 AbstractCegarLoop]: Abstraction has 14534 states and 19866 transitions. [2019-09-08 10:58:18,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 10:58:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states and 19866 transitions. [2019-09-08 10:58:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:58:18,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:18,821 INFO L399 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-09-08 10:58:18,821 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:18,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:18,821 INFO L82 PathProgramCache]: Analyzing trace with hash -319630535, now seen corresponding path program 1 times [2019-09-08 10:58:18,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:18,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:18,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:18,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:18,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:58:19,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:19,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:58:19,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:58:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:58:19,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:58:19,216 INFO L87 Difference]: Start difference. First operand 14534 states and 19866 transitions. Second operand 12 states. [2019-09-08 10:58:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:39,127 INFO L93 Difference]: Finished difference Result 28799 states and 39701 transitions. [2019-09-08 10:58:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:58:39,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-08 10:58:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:39,158 INFO L225 Difference]: With dead ends: 28799 [2019-09-08 10:58:39,158 INFO L226 Difference]: Without dead ends: 28312 [2019-09-08 10:58:39,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-08 10:58:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28312 states. [2019-09-08 10:58:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28312 to 14533. [2019-09-08 10:58:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14533 states. [2019-09-08 10:58:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14533 states to 14533 states and 19864 transitions. [2019-09-08 10:58:47,832 INFO L78 Accepts]: Start accepts. Automaton has 14533 states and 19864 transitions. Word has length 83 [2019-09-08 10:58:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:47,833 INFO L475 AbstractCegarLoop]: Abstraction has 14533 states and 19864 transitions. [2019-09-08 10:58:47,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:58:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 14533 states and 19864 transitions. [2019-09-08 10:58:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:58:47,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:47,837 INFO L399 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-09-08 10:58:47,838 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:47,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash -450542762, now seen corresponding path program 1 times [2019-09-08 10:58:47,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:47,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:47,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:58:48,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:48,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:58:48,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:58:48,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:58:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:58:48,445 INFO L87 Difference]: Start difference. First operand 14533 states and 19864 transitions. Second operand 13 states. [2019-09-08 10:58:49,356 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 10:58:49,593 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 10:58:49,837 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-08 10:58:50,170 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-08 10:58:50,441 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 10:58:50,643 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 10:58:51,816 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-08 10:58:52,234 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 10:58:55,322 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 10:58:56,575 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-08 10:58:57,327 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 10:59:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:24,903 INFO L93 Difference]: Finished difference Result 49596 states and 68464 transitions. [2019-09-08 10:59:24,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:59:24,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-09-08 10:59:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:24,956 INFO L225 Difference]: With dead ends: 49596 [2019-09-08 10:59:24,956 INFO L226 Difference]: Without dead ends: 49051 [2019-09-08 10:59:24,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=267, Invalid=725, Unknown=0, NotChecked=0, Total=992 [2019-09-08 10:59:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49051 states. [2019-09-08 10:59:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49051 to 14474. [2019-09-08 10:59:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14474 states. [2019-09-08 10:59:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14474 states to 14474 states and 19794 transitions. [2019-09-08 10:59:34,064 INFO L78 Accepts]: Start accepts. Automaton has 14474 states and 19794 transitions. Word has length 83 [2019-09-08 10:59:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:34,064 INFO L475 AbstractCegarLoop]: Abstraction has 14474 states and 19794 transitions. [2019-09-08 10:59:34,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:59:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 14474 states and 19794 transitions. [2019-09-08 10:59:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 10:59:34,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:34,071 INFO L399 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-09-08 10:59:34,071 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash -492516632, now seen corresponding path program 1 times [2019-09-08 10:59:34,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:34,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:34,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:34,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:34,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:34,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:59:34,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:59:34,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:59:34,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:59:34,177 INFO L87 Difference]: Start difference. First operand 14474 states and 19794 transitions. Second operand 7 states. [2019-09-08 11:00:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:18,556 INFO L93 Difference]: Finished difference Result 85591 states and 118675 transitions. [2019-09-08 11:00:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:00:18,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-08 11:00:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:18,642 INFO L225 Difference]: With dead ends: 85591 [2019-09-08 11:00:18,642 INFO L226 Difference]: Without dead ends: 72489 [2019-09-08 11:00:18,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:00:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72489 states. [2019-09-08 11:00:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72489 to 45963. [2019-09-08 11:00:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45963 states. [2019-09-08 11:00:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45963 states to 45963 states and 62528 transitions. [2019-09-08 11:00:48,668 INFO L78 Accepts]: Start accepts. Automaton has 45963 states and 62528 transitions. Word has length 86 [2019-09-08 11:00:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:48,668 INFO L475 AbstractCegarLoop]: Abstraction has 45963 states and 62528 transitions. [2019-09-08 11:00:48,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:00:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 45963 states and 62528 transitions. [2019-09-08 11:00:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:00:48,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:48,679 INFO L399 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, 1] [2019-09-08 11:00:48,679 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1251473893, now seen corresponding path program 1 times [2019-09-08 11:00:48,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:48,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:48,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:48,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:48,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:00:48,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:00:48,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:00:48,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:00:48,798 INFO L87 Difference]: Start difference. First operand 45963 states and 62528 transitions. Second operand 6 states. [2019-09-08 11:01:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:16,851 INFO L93 Difference]: Finished difference Result 45971 states and 62532 transitions. [2019-09-08 11:01:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:01:16,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-08 11:01:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:16,896 INFO L225 Difference]: With dead ends: 45971 [2019-09-08 11:01:16,896 INFO L226 Difference]: Without dead ends: 44658 [2019-09-08 11:01:16,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:01:16,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44658 states. [2019-09-08 11:01:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44658 to 44652. [2019-09-08 11:01:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44652 states. [2019-09-08 11:01:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44652 states to 44652 states and 60803 transitions. [2019-09-08 11:01:44,359 INFO L78 Accepts]: Start accepts. Automaton has 44652 states and 60803 transitions. Word has length 87 [2019-09-08 11:01:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:44,360 INFO L475 AbstractCegarLoop]: Abstraction has 44652 states and 60803 transitions. [2019-09-08 11:01:44,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:01:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 44652 states and 60803 transitions. [2019-09-08 11:01:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:01:44,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:44,370 INFO L399 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, 1, 1] [2019-09-08 11:01:44,370 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:44,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1916938305, now seen corresponding path program 1 times [2019-09-08 11:01:44,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:44,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:44,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:44,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:44,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:44,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:44,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:01:44,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:01:44,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:01:44,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:01:44,452 INFO L87 Difference]: Start difference. First operand 44652 states and 60803 transitions. Second operand 6 states.