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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:30:04,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:30:04,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:30:04,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:30:04,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:30:04,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:30:04,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:30:04,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:30:04,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:30:04,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:30:04,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:30:04,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:30:04,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:30:04,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:30:04,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:30:04,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:30:04,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:30:04,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:30:04,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:30:04,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:30:04,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:30:04,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:30:04,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:30:04,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:30:04,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:30:04,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:30:04,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:30:04,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:30:04,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:30:04,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:30:04,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:30:04,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:30:04,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:30:04,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:30:04,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:30:04,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:30:04,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:30:04,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:30:04,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:30:04,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:30:04,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:30:04,648 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 09:30:04,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:30:04,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:30:04,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:30:04,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:30:04,674 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:30:04,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:30:04,674 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:30:04,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:30:04,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:30:04,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:30:04,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:30:04,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:30:04,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:30:04,677 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:30:04,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:30:04,678 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:30:04,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:30:04,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:30:04,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:30:04,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:30:04,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:30:04,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:30:04,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:30:04,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:30:04,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:30:04,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:30:04,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:30:04,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:30:04,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:30:04,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:30:04,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:30:04,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:30:04,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:30:04,740 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:30:04,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 09:30:04,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821881c36/a6702ada7fd64e95a142f09aa06b3a6b/FLAG49abef9d7 [2019-09-08 09:30:05,381 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:30:05,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 09:30:05,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821881c36/a6702ada7fd64e95a142f09aa06b3a6b/FLAG49abef9d7 [2019-09-08 09:30:05,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821881c36/a6702ada7fd64e95a142f09aa06b3a6b [2019-09-08 09:30:05,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:30:05,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:30:05,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:30:05,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:30:05,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:30:05,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:30:05" (1/1) ... [2019-09-08 09:30:05,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ffce86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:05, skipping insertion in model container [2019-09-08 09:30:05,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:30:05" (1/1) ... [2019-09-08 09:30:05,686 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:30:05,760 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:30:06,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:30:06,298 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:30:06,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:30:06,472 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:30:06,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06 WrapperNode [2019-09-08 09:30:06,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:30:06,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:30:06,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:30:06,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:30:06,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06" (1/1) ... [2019-09-08 09:30:06,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06" (1/1) ... [2019-09-08 09:30:06,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06" (1/1) ... [2019-09-08 09:30:06,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06" (1/1) ... [2019-09-08 09:30:06,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06" (1/1) ... [2019-09-08 09:30:06,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06" (1/1) ... [2019-09-08 09:30:06,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06" (1/1) ... [2019-09-08 09:30:06,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:30:06,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:30:06,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:30:06,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:30:06,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06" (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 09:30:06,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:30:06,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:30:06,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:30:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:30:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:30:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:30:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:30:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:30:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:30:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:30:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:30:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:30:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:30:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:30:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:30:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:30:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:30:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:30:08,213 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:30:08,213 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:30:08,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:30:08 BoogieIcfgContainer [2019-09-08 09:30:08,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:30:08,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:30:08,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:30:08,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:30:08,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:30:05" (1/3) ... [2019-09-08 09:30:08,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468b4005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:30:08, skipping insertion in model container [2019-09-08 09:30:08,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:06" (2/3) ... [2019-09-08 09:30:08,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468b4005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:30:08, skipping insertion in model container [2019-09-08 09:30:08,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:30:08" (3/3) ... [2019-09-08 09:30:08,229 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 09:30:08,242 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:30:08,252 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:30:08,271 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:30:08,309 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:30:08,310 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:30:08,310 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:30:08,310 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:30:08,311 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:30:08,311 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:30:08,311 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:30:08,312 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:30:08,312 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:30:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states. [2019-09-08 09:30:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 09:30:08,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:08,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:08,362 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1850165601, now seen corresponding path program 1 times [2019-09-08 09:30:08,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:08,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:08,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:08,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:08,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:09,001 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 09:30:09,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:09,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:09,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:09,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:09,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:09,026 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 3 states. [2019-09-08 09:30:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:09,284 INFO L93 Difference]: Finished difference Result 605 states and 1058 transitions. [2019-09-08 09:30:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:09,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-08 09:30:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:09,304 INFO L225 Difference]: With dead ends: 605 [2019-09-08 09:30:09,305 INFO L226 Difference]: Without dead ends: 493 [2019-09-08 09:30:09,309 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 09:30:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-08 09:30:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2019-09-08 09:30:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-09-08 09:30:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2019-09-08 09:30:09,401 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 148 [2019-09-08 09:30:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:09,402 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2019-09-08 09:30:09,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2019-09-08 09:30:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 09:30:09,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:09,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:09,408 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:09,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:09,408 INFO L82 PathProgramCache]: Analyzing trace with hash -835560269, now seen corresponding path program 1 times [2019-09-08 09:30:09,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:09,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:09,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:09,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:09,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:09,856 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 09:30:09,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:09,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:09,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:09,860 INFO L87 Difference]: Start difference. First operand 491 states and 730 transitions. Second operand 4 states. [2019-09-08 09:30:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:10,051 INFO L93 Difference]: Finished difference Result 1423 states and 2113 transitions. [2019-09-08 09:30:10,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:10,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-08 09:30:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:10,060 INFO L225 Difference]: With dead ends: 1423 [2019-09-08 09:30:10,061 INFO L226 Difference]: Without dead ends: 945 [2019-09-08 09:30:10,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-08 09:30:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2019-09-08 09:30:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-09-08 09:30:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1389 transitions. [2019-09-08 09:30:10,148 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1389 transitions. Word has length 148 [2019-09-08 09:30:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:10,150 INFO L475 AbstractCegarLoop]: Abstraction has 943 states and 1389 transitions. [2019-09-08 09:30:10,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1389 transitions. [2019-09-08 09:30:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 09:30:10,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:10,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:10,162 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash -312485947, now seen corresponding path program 1 times [2019-09-08 09:30:10,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:10,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:10,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:10,285 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 09:30:10,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:10,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:10,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:10,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:10,288 INFO L87 Difference]: Start difference. First operand 943 states and 1389 transitions. Second operand 3 states. [2019-09-08 09:30:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:10,403 INFO L93 Difference]: Finished difference Result 2783 states and 4097 transitions. [2019-09-08 09:30:10,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:10,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 09:30:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:10,418 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 09:30:10,418 INFO L226 Difference]: Without dead ends: 1872 [2019-09-08 09:30:10,421 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 09:30:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-09-08 09:30:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 945. [2019-09-08 09:30:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-09-08 09:30:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1391 transitions. [2019-09-08 09:30:10,504 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1391 transitions. Word has length 149 [2019-09-08 09:30:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:10,505 INFO L475 AbstractCegarLoop]: Abstraction has 945 states and 1391 transitions. [2019-09-08 09:30:10,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1391 transitions. [2019-09-08 09:30:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:30:10,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:10,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:10,508 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:10,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1358823732, now seen corresponding path program 1 times [2019-09-08 09:30:10,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:10,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:10,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:10,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:10,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:10,745 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 09:30:10,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:10,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:10,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:10,747 INFO L87 Difference]: Start difference. First operand 945 states and 1391 transitions. Second operand 4 states. [2019-09-08 09:30:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:10,822 INFO L93 Difference]: Finished difference Result 1876 states and 2764 transitions. [2019-09-08 09:30:10,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:10,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-08 09:30:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:10,828 INFO L225 Difference]: With dead ends: 1876 [2019-09-08 09:30:10,829 INFO L226 Difference]: Without dead ends: 943 [2019-09-08 09:30:10,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-08 09:30:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2019-09-08 09:30:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-09-08 09:30:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1387 transitions. [2019-09-08 09:30:10,888 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1387 transitions. Word has length 150 [2019-09-08 09:30:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:10,888 INFO L475 AbstractCegarLoop]: Abstraction has 943 states and 1387 transitions. [2019-09-08 09:30:10,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1387 transitions. [2019-09-08 09:30:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:30:10,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:10,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:10,892 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:10,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1528940934, now seen corresponding path program 1 times [2019-09-08 09:30:10,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:10,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:10,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:10,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:10,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:11,046 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 09:30:11,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:11,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:11,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:11,049 INFO L87 Difference]: Start difference. First operand 943 states and 1387 transitions. Second operand 3 states. [2019-09-08 09:30:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:11,185 INFO L93 Difference]: Finished difference Result 2159 states and 3193 transitions. [2019-09-08 09:30:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:11,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 09:30:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:11,195 INFO L225 Difference]: With dead ends: 2159 [2019-09-08 09:30:11,196 INFO L226 Difference]: Without dead ends: 1396 [2019-09-08 09:30:11,198 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 09:30:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-09-08 09:30:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-09-08 09:30:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-09-08 09:30:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2025 transitions. [2019-09-08 09:30:11,301 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2025 transitions. Word has length 150 [2019-09-08 09:30:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:11,301 INFO L475 AbstractCegarLoop]: Abstraction has 1394 states and 2025 transitions. [2019-09-08 09:30:11,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2025 transitions. [2019-09-08 09:30:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 09:30:11,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:11,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:11,308 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2049235060, now seen corresponding path program 1 times [2019-09-08 09:30:11,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:11,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:11,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:11,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:11,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:11,460 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 09:30:11,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:11,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:11,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:11,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:11,462 INFO L87 Difference]: Start difference. First operand 1394 states and 2025 transitions. Second operand 3 states. [2019-09-08 09:30:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:11,904 INFO L93 Difference]: Finished difference Result 3707 states and 5443 transitions. [2019-09-08 09:30:11,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:11,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 09:30:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:11,920 INFO L225 Difference]: With dead ends: 3707 [2019-09-08 09:30:11,921 INFO L226 Difference]: Without dead ends: 2595 [2019-09-08 09:30:11,927 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 09:30:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-09-08 09:30:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2593. [2019-09-08 09:30:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-09-08 09:30:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3764 transitions. [2019-09-08 09:30:12,120 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3764 transitions. Word has length 156 [2019-09-08 09:30:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:12,121 INFO L475 AbstractCegarLoop]: Abstraction has 2593 states and 3764 transitions. [2019-09-08 09:30:12,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3764 transitions. [2019-09-08 09:30:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 09:30:12,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:12,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:12,128 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:12,128 INFO L82 PathProgramCache]: Analyzing trace with hash 327258095, now seen corresponding path program 1 times [2019-09-08 09:30:12,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:12,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:12,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:12,343 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 09:30:12,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:12,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:30:12,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:30:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:30:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:30:12,345 INFO L87 Difference]: Start difference. First operand 2593 states and 3764 transitions. Second operand 6 states. [2019-09-08 09:30:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:13,098 INFO L93 Difference]: Finished difference Result 6395 states and 10006 transitions. [2019-09-08 09:30:13,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:30:13,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-09-08 09:30:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:13,127 INFO L225 Difference]: With dead ends: 6395 [2019-09-08 09:30:13,127 INFO L226 Difference]: Without dead ends: 5489 [2019-09-08 09:30:13,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:30:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2019-09-08 09:30:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5453. [2019-09-08 09:30:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-09-08 09:30:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8364 transitions. [2019-09-08 09:30:13,501 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8364 transitions. Word has length 156 [2019-09-08 09:30:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:13,501 INFO L475 AbstractCegarLoop]: Abstraction has 5453 states and 8364 transitions. [2019-09-08 09:30:13,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:30:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8364 transitions. [2019-09-08 09:30:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 09:30:13,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:13,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:13,508 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1936499521, now seen corresponding path program 1 times [2019-09-08 09:30:13,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:13,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:13,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:13,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:13,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:13,783 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 09:30:13,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:13,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:30:13,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:30:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:30:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:30:13,785 INFO L87 Difference]: Start difference. First operand 5453 states and 8364 transitions. Second operand 8 states. [2019-09-08 09:30:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:14,243 INFO L93 Difference]: Finished difference Result 9061 states and 14264 transitions. [2019-09-08 09:30:14,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:14,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-09-08 09:30:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:14,269 INFO L225 Difference]: With dead ends: 9061 [2019-09-08 09:30:14,269 INFO L226 Difference]: Without dead ends: 5455 [2019-09-08 09:30:14,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:30:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2019-09-08 09:30:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5453. [2019-09-08 09:30:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-09-08 09:30:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8328 transitions. [2019-09-08 09:30:14,633 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8328 transitions. Word has length 156 [2019-09-08 09:30:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:14,634 INFO L475 AbstractCegarLoop]: Abstraction has 5453 states and 8328 transitions. [2019-09-08 09:30:14,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:30:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8328 transitions. [2019-09-08 09:30:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 09:30:14,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:14,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:14,640 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash -681147618, now seen corresponding path program 1 times [2019-09-08 09:30:14,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:14,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:14,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:14,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:14,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:14,852 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 09:30:14,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:14,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:14,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:14,854 INFO L87 Difference]: Start difference. First operand 5453 states and 8328 transitions. Second operand 4 states. [2019-09-08 09:30:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:15,395 INFO L93 Difference]: Finished difference Result 14216 states and 21721 transitions. [2019-09-08 09:30:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:15,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-08 09:30:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:15,449 INFO L225 Difference]: With dead ends: 14216 [2019-09-08 09:30:15,449 INFO L226 Difference]: Without dead ends: 8786 [2019-09-08 09:30:15,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8786 states. [2019-09-08 09:30:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8786 to 8784. [2019-09-08 09:30:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8784 states. [2019-09-08 09:30:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8784 states to 8784 states and 13279 transitions. [2019-09-08 09:30:16,055 INFO L78 Accepts]: Start accepts. Automaton has 8784 states and 13279 transitions. Word has length 156 [2019-09-08 09:30:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:16,055 INFO L475 AbstractCegarLoop]: Abstraction has 8784 states and 13279 transitions. [2019-09-08 09:30:16,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 8784 states and 13279 transitions. [2019-09-08 09:30:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:30:16,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:16,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:16,063 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1122789079, now seen corresponding path program 1 times [2019-09-08 09:30:16,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:16,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:16,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:16,174 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 09:30:16,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:16,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:16,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:16,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:16,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:16,176 INFO L87 Difference]: Start difference. First operand 8784 states and 13279 transitions. Second operand 3 states. [2019-09-08 09:30:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:17,230 INFO L93 Difference]: Finished difference Result 25169 states and 38128 transitions. [2019-09-08 09:30:17,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:17,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 09:30:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:17,272 INFO L225 Difference]: With dead ends: 25169 [2019-09-08 09:30:17,272 INFO L226 Difference]: Without dead ends: 16843 [2019-09-08 09:30:17,293 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 09:30:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16843 states. [2019-09-08 09:30:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16843 to 16841. [2019-09-08 09:30:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16841 states. [2019-09-08 09:30:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16841 states to 16841 states and 25210 transitions. [2019-09-08 09:30:18,755 INFO L78 Accepts]: Start accepts. Automaton has 16841 states and 25210 transitions. Word has length 158 [2019-09-08 09:30:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:18,755 INFO L475 AbstractCegarLoop]: Abstraction has 16841 states and 25210 transitions. [2019-09-08 09:30:18,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 16841 states and 25210 transitions. [2019-09-08 09:30:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:30:18,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:18,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:18,773 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash 725817844, now seen corresponding path program 1 times [2019-09-08 09:30:18,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:18,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:18,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:18,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:18,915 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 09:30:18,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:18,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:18,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:18,917 INFO L87 Difference]: Start difference. First operand 16841 states and 25210 transitions. Second operand 4 states. [2019-09-08 09:30:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:19,645 INFO L93 Difference]: Finished difference Result 26903 states and 40236 transitions. [2019-09-08 09:30:19,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:19,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-08 09:30:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:19,680 INFO L225 Difference]: With dead ends: 26903 [2019-09-08 09:30:19,680 INFO L226 Difference]: Without dead ends: 13712 [2019-09-08 09:30:19,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13712 states. [2019-09-08 09:30:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13712 to 13712. [2019-09-08 09:30:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13712 states. [2019-09-08 09:30:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13712 states to 13712 states and 20437 transitions. [2019-09-08 09:30:20,335 INFO L78 Accepts]: Start accepts. Automaton has 13712 states and 20437 transitions. Word has length 158 [2019-09-08 09:30:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:20,335 INFO L475 AbstractCegarLoop]: Abstraction has 13712 states and 20437 transitions. [2019-09-08 09:30:20,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 13712 states and 20437 transitions. [2019-09-08 09:30:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 09:30:20,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:20,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:20,347 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:20,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:20,348 INFO L82 PathProgramCache]: Analyzing trace with hash 579616721, now seen corresponding path program 1 times [2019-09-08 09:30:20,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:20,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:20,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:20,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:20,526 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 09:30:20,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:20,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:20,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:20,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:20,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:20,528 INFO L87 Difference]: Start difference. First operand 13712 states and 20437 transitions. Second operand 4 states. [2019-09-08 09:30:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:21,659 INFO L93 Difference]: Finished difference Result 40158 states and 59777 transitions. [2019-09-08 09:30:21,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:21,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-08 09:30:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:21,722 INFO L225 Difference]: With dead ends: 40158 [2019-09-08 09:30:21,722 INFO L226 Difference]: Without dead ends: 26489 [2019-09-08 09:30:21,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26489 states. [2019-09-08 09:30:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26489 to 26487. [2019-09-08 09:30:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26487 states. [2019-09-08 09:30:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 39050 transitions. [2019-09-08 09:30:22,891 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 39050 transitions. Word has length 164 [2019-09-08 09:30:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:22,892 INFO L475 AbstractCegarLoop]: Abstraction has 26487 states and 39050 transitions. [2019-09-08 09:30:22,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 39050 transitions. [2019-09-08 09:30:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 09:30:22,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:22,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:22,908 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:22,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1599816613, now seen corresponding path program 1 times [2019-09-08 09:30:22,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:22,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:22,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:22,980 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 09:30:22,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:22,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:22,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:22,982 INFO L87 Difference]: Start difference. First operand 26487 states and 39050 transitions. Second operand 3 states. [2019-09-08 09:30:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:25,347 INFO L93 Difference]: Finished difference Result 79261 states and 116893 transitions. [2019-09-08 09:30:25,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:25,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 09:30:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:25,434 INFO L225 Difference]: With dead ends: 79261 [2019-09-08 09:30:25,434 INFO L226 Difference]: Without dead ends: 52883 [2019-09-08 09:30:25,476 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 09:30:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52883 states. [2019-09-08 09:30:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52883 to 26493. [2019-09-08 09:30:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26493 states. [2019-09-08 09:30:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 39056 transitions. [2019-09-08 09:30:26,915 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 39056 transitions. Word has length 165 [2019-09-08 09:30:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:26,915 INFO L475 AbstractCegarLoop]: Abstraction has 26493 states and 39056 transitions. [2019-09-08 09:30:26,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 39056 transitions. [2019-09-08 09:30:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:30:26,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:26,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:26,931 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1477917308, now seen corresponding path program 1 times [2019-09-08 09:30:26,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:26,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:26,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:27,027 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 09:30:27,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:27,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:27,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:27,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:27,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:27,029 INFO L87 Difference]: Start difference. First operand 26493 states and 39056 transitions. Second operand 3 states. [2019-09-08 09:30:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:28,957 INFO L93 Difference]: Finished difference Result 76746 states and 113125 transitions. [2019-09-08 09:30:28,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:28,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 09:30:28,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:29,018 INFO L225 Difference]: With dead ends: 76746 [2019-09-08 09:30:29,018 INFO L226 Difference]: Without dead ends: 51200 [2019-09-08 09:30:29,044 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 09:30:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51200 states. [2019-09-08 09:30:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51200 to 51198. [2019-09-08 09:30:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51198 states. [2019-09-08 09:30:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51198 states to 51198 states and 74563 transitions. [2019-09-08 09:30:32,355 INFO L78 Accepts]: Start accepts. Automaton has 51198 states and 74563 transitions. Word has length 166 [2019-09-08 09:30:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:32,355 INFO L475 AbstractCegarLoop]: Abstraction has 51198 states and 74563 transitions. [2019-09-08 09:30:32,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 51198 states and 74563 transitions. [2019-09-08 09:30:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:30:32,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:32,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:32,376 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash 561013721, now seen corresponding path program 1 times [2019-09-08 09:30:32,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:32,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:32,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:32,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:32,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:32,518 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 09:30:32,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:32,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:32,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:32,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:32,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:32,519 INFO L87 Difference]: Start difference. First operand 51198 states and 74563 transitions. Second operand 4 states. [2019-09-08 09:30:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:34,120 INFO L93 Difference]: Finished difference Result 89658 states and 130557 transitions. [2019-09-08 09:30:34,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:34,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 09:30:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:34,178 INFO L225 Difference]: With dead ends: 89658 [2019-09-08 09:30:34,179 INFO L226 Difference]: Without dead ends: 39289 [2019-09-08 09:30:34,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39289 states. [2019-09-08 09:30:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39289 to 39289. [2019-09-08 09:30:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39289 states. [2019-09-08 09:30:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39289 states to 39289 states and 56981 transitions. [2019-09-08 09:30:37,211 INFO L78 Accepts]: Start accepts. Automaton has 39289 states and 56981 transitions. Word has length 166 [2019-09-08 09:30:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:37,211 INFO L475 AbstractCegarLoop]: Abstraction has 39289 states and 56981 transitions. [2019-09-08 09:30:37,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 39289 states and 56981 transitions. [2019-09-08 09:30:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:30:37,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:37,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:37,229 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:37,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2055563735, now seen corresponding path program 1 times [2019-09-08 09:30:37,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:37,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:37,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:37,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:37,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:37,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 09:30:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:37,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:37,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:37,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:37,306 INFO L87 Difference]: Start difference. First operand 39289 states and 56981 transitions. Second operand 3 states. [2019-09-08 09:30:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:40,309 INFO L93 Difference]: Finished difference Result 89984 states and 132648 transitions. [2019-09-08 09:30:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:40,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 09:30:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:40,381 INFO L225 Difference]: With dead ends: 89984 [2019-09-08 09:30:40,381 INFO L226 Difference]: Without dead ends: 54812 [2019-09-08 09:30:40,417 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 09:30:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54812 states. [2019-09-08 09:30:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54812 to 54810. [2019-09-08 09:30:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54810 states. [2019-09-08 09:30:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54810 states to 54810 states and 80195 transitions. [2019-09-08 09:30:43,009 INFO L78 Accepts]: Start accepts. Automaton has 54810 states and 80195 transitions. Word has length 172 [2019-09-08 09:30:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:43,009 INFO L475 AbstractCegarLoop]: Abstraction has 54810 states and 80195 transitions. [2019-09-08 09:30:43,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 54810 states and 80195 transitions. [2019-09-08 09:30:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:30:43,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:43,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:43,024 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1864738212, now seen corresponding path program 1 times [2019-09-08 09:30:43,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:43,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:43,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:43,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:43,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:43,132 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 09:30:43,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:43,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:43,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:43,133 INFO L87 Difference]: Start difference. First operand 54810 states and 80195 transitions. Second operand 3 states. [2019-09-08 09:30:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:48,428 INFO L93 Difference]: Finished difference Result 143020 states and 210665 transitions. [2019-09-08 09:30:48,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:48,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 09:30:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:48,548 INFO L225 Difference]: With dead ends: 143020 [2019-09-08 09:30:48,549 INFO L226 Difference]: Without dead ends: 99481 [2019-09-08 09:30:48,586 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 09:30:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99481 states. [2019-09-08 09:30:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99481 to 99479. [2019-09-08 09:30:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99479 states. [2019-09-08 09:30:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99479 states to 99479 states and 144973 transitions. [2019-09-08 09:30:55,165 INFO L78 Accepts]: Start accepts. Automaton has 99479 states and 144973 transitions. Word has length 172 [2019-09-08 09:30:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:55,165 INFO L475 AbstractCegarLoop]: Abstraction has 99479 states and 144973 transitions. [2019-09-08 09:30:55,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 99479 states and 144973 transitions. [2019-09-08 09:30:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:30:55,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:55,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:55,195 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:55,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1996973343, now seen corresponding path program 1 times [2019-09-08 09:30:55,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:55,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:55,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:55,447 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 09:30:55,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:55,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 09:30:55,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 09:30:55,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 09:30:55,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:30:55,449 INFO L87 Difference]: Start difference. First operand 99479 states and 144973 transitions. Second operand 10 states. [2019-09-08 09:30:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:59,062 INFO L93 Difference]: Finished difference Result 160145 states and 235376 transitions. [2019-09-08 09:30:59,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:30:59,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 172 [2019-09-08 09:30:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:59,144 INFO L225 Difference]: With dead ends: 160145 [2019-09-08 09:30:59,144 INFO L226 Difference]: Without dead ends: 64617 [2019-09-08 09:30:59,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 09:30:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64617 states. [2019-09-08 09:31:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64617 to 36144. [2019-09-08 09:31:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36144 states. [2019-09-08 09:31:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36144 states to 36144 states and 51968 transitions. [2019-09-08 09:31:01,729 INFO L78 Accepts]: Start accepts. Automaton has 36144 states and 51968 transitions. Word has length 172 [2019-09-08 09:31:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:01,730 INFO L475 AbstractCegarLoop]: Abstraction has 36144 states and 51968 transitions. [2019-09-08 09:31:01,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 09:31:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 36144 states and 51968 transitions. [2019-09-08 09:31:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:31:01,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:01,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:01,744 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:01,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash 406501079, now seen corresponding path program 1 times [2019-09-08 09:31:01,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:01,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:01,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:02,004 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 09:31:02,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:02,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:31:02,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:31:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:31:02,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:31:02,007 INFO L87 Difference]: Start difference. First operand 36144 states and 51968 transitions. Second operand 9 states. [2019-09-08 09:31:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:06,934 INFO L93 Difference]: Finished difference Result 93711 states and 137610 transitions. [2019-09-08 09:31:06,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:31:06,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2019-09-08 09:31:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:07,026 INFO L225 Difference]: With dead ends: 93711 [2019-09-08 09:31:07,026 INFO L226 Difference]: Without dead ends: 66827 [2019-09-08 09:31:07,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:31:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66827 states. [2019-09-08 09:31:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66827 to 66555. [2019-09-08 09:31:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66555 states. [2019-09-08 09:31:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66555 states to 66555 states and 96275 transitions. [2019-09-08 09:31:11,040 INFO L78 Accepts]: Start accepts. Automaton has 66555 states and 96275 transitions. Word has length 172 [2019-09-08 09:31:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:11,041 INFO L475 AbstractCegarLoop]: Abstraction has 66555 states and 96275 transitions. [2019-09-08 09:31:11,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:31:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 66555 states and 96275 transitions. [2019-09-08 09:31:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:31:11,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:11,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:11,056 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1518935673, now seen corresponding path program 1 times [2019-09-08 09:31:11,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:11,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:11,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:11,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:11,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:11,370 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 09:31:11,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:11,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 09:31:11,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 09:31:11,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 09:31:11,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 09:31:11,371 INFO L87 Difference]: Start difference. First operand 66555 states and 96275 transitions. Second operand 13 states. [2019-09-08 09:31:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:18,908 INFO L93 Difference]: Finished difference Result 112297 states and 163873 transitions. [2019-09-08 09:31:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 09:31:18,909 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 172 [2019-09-08 09:31:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:19,090 INFO L225 Difference]: With dead ends: 112297 [2019-09-08 09:31:19,090 INFO L226 Difference]: Without dead ends: 98611 [2019-09-08 09:31:19,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-09-08 09:31:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98611 states. [2019-09-08 09:31:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98611 to 68141. [2019-09-08 09:31:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68141 states. [2019-09-08 09:31:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68141 states to 68141 states and 98132 transitions. [2019-09-08 09:31:26,726 INFO L78 Accepts]: Start accepts. Automaton has 68141 states and 98132 transitions. Word has length 172 [2019-09-08 09:31:26,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:26,727 INFO L475 AbstractCegarLoop]: Abstraction has 68141 states and 98132 transitions. [2019-09-08 09:31:26,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 09:31:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 68141 states and 98132 transitions. [2019-09-08 09:31:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:31:26,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:26,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:26,744 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1115588719, now seen corresponding path program 1 times [2019-09-08 09:31:26,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:26,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:26,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:26,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:26,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:31:27,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:27,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 09:31:27,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 09:31:27,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 09:31:27,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-08 09:31:27,234 INFO L87 Difference]: Start difference. First operand 68141 states and 98132 transitions. Second operand 15 states. [2019-09-08 09:31:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:39,272 INFO L93 Difference]: Finished difference Result 148780 states and 216187 transitions. [2019-09-08 09:31:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 09:31:39,273 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 172 [2019-09-08 09:31:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:39,441 INFO L225 Difference]: With dead ends: 148780 [2019-09-08 09:31:39,441 INFO L226 Difference]: Without dead ends: 142052 [2019-09-08 09:31:39,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:31:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142052 states. [2019-09-08 09:31:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142052 to 70729. [2019-09-08 09:31:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70729 states. [2019-09-08 09:31:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70729 states to 70729 states and 101144 transitions. [2019-09-08 09:31:45,960 INFO L78 Accepts]: Start accepts. Automaton has 70729 states and 101144 transitions. Word has length 172 [2019-09-08 09:31:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:45,961 INFO L475 AbstractCegarLoop]: Abstraction has 70729 states and 101144 transitions. [2019-09-08 09:31:45,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 09:31:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 70729 states and 101144 transitions. [2019-09-08 09:31:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:31:45,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:45,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:45,979 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:45,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:45,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1983572546, now seen corresponding path program 1 times [2019-09-08 09:31:45,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:45,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:45,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:45,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:45,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:46,179 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 09:31:46,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:46,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:31:46,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:31:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:31:46,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:31:46,181 INFO L87 Difference]: Start difference. First operand 70729 states and 101144 transitions. Second operand 4 states. [2019-09-08 09:31:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:51,998 INFO L93 Difference]: Finished difference Result 136816 states and 195561 transitions. [2019-09-08 09:31:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:31:51,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-08 09:31:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:52,082 INFO L225 Difference]: With dead ends: 136816 [2019-09-08 09:31:52,082 INFO L226 Difference]: Without dead ends: 66492 [2019-09-08 09:31:52,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:31:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66492 states. [2019-09-08 09:31:59,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66492 to 66445. [2019-09-08 09:31:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66445 states. [2019-09-08 09:31:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66445 states to 66445 states and 94828 transitions. [2019-09-08 09:31:59,168 INFO L78 Accepts]: Start accepts. Automaton has 66445 states and 94828 transitions. Word has length 172 [2019-09-08 09:31:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:59,168 INFO L475 AbstractCegarLoop]: Abstraction has 66445 states and 94828 transitions. [2019-09-08 09:31:59,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:31:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 66445 states and 94828 transitions. [2019-09-08 09:31:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:31:59,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:59,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:59,186 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash 920545503, now seen corresponding path program 1 times [2019-09-08 09:31:59,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:59,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:59,331 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 09:31:59,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:59,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:31:59,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:31:59,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:31:59,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:31:59,332 INFO L87 Difference]: Start difference. First operand 66445 states and 94828 transitions. Second operand 4 states. [2019-09-08 09:32:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:04,906 INFO L93 Difference]: Finished difference Result 133000 states and 189792 transitions. [2019-09-08 09:32:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:32:04,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-08 09:32:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:04,985 INFO L225 Difference]: With dead ends: 133000 [2019-09-08 09:32:04,985 INFO L226 Difference]: Without dead ends: 66710 [2019-09-08 09:32:05,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66710 states. [2019-09-08 09:32:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66710 to 66576. [2019-09-08 09:32:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66576 states. [2019-09-08 09:32:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66576 states to 66576 states and 94966 transitions. [2019-09-08 09:32:12,251 INFO L78 Accepts]: Start accepts. Automaton has 66576 states and 94966 transitions. Word has length 174 [2019-09-08 09:32:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:12,251 INFO L475 AbstractCegarLoop]: Abstraction has 66576 states and 94966 transitions. [2019-09-08 09:32:12,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 66576 states and 94966 transitions. [2019-09-08 09:32:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:32:12,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:12,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:12,267 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:12,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1952765221, now seen corresponding path program 1 times [2019-09-08 09:32:12,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:12,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:12,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:12,319 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 09:32:12,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:12,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:12,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:12,320 INFO L87 Difference]: Start difference. First operand 66576 states and 94966 transitions. Second operand 3 states. [2019-09-08 09:32:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:23,004 INFO L93 Difference]: Finished difference Result 184237 states and 262647 transitions. [2019-09-08 09:32:23,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:23,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 09:32:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:23,160 INFO L225 Difference]: With dead ends: 184237 [2019-09-08 09:32:23,160 INFO L226 Difference]: Without dead ends: 132947 [2019-09-08 09:32:23,201 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 09:32:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132947 states. [2019-09-08 09:32:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132947 to 66586. [2019-09-08 09:32:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66586 states. [2019-09-08 09:32:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66586 states to 66586 states and 94976 transitions. [2019-09-08 09:32:29,760 INFO L78 Accepts]: Start accepts. Automaton has 66586 states and 94976 transitions. Word has length 175 [2019-09-08 09:32:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:29,760 INFO L475 AbstractCegarLoop]: Abstraction has 66586 states and 94976 transitions. [2019-09-08 09:32:29,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 66586 states and 94976 transitions. [2019-09-08 09:32:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:32:29,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:29,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:29,777 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:29,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:29,778 INFO L82 PathProgramCache]: Analyzing trace with hash 246843552, now seen corresponding path program 1 times [2019-09-08 09:32:29,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:29,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:29,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:29,905 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 09:32:29,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:29,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:29,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:29,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:29,907 INFO L87 Difference]: Start difference. First operand 66586 states and 94976 transitions. Second operand 4 states. [2019-09-08 09:32:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:37,681 INFO L93 Difference]: Finished difference Result 118394 states and 168503 transitions. [2019-09-08 09:32:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:32:37,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 09:32:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:37,754 INFO L225 Difference]: With dead ends: 118394 [2019-09-08 09:32:37,754 INFO L226 Difference]: Without dead ends: 66576 [2019-09-08 09:32:37,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66576 states. [2019-09-08 09:32:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66576 to 66576. [2019-09-08 09:32:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66576 states. [2019-09-08 09:32:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66576 states to 66576 states and 94961 transitions. [2019-09-08 09:32:43,417 INFO L78 Accepts]: Start accepts. Automaton has 66576 states and 94961 transitions. Word has length 176 [2019-09-08 09:32:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:43,417 INFO L475 AbstractCegarLoop]: Abstraction has 66576 states and 94961 transitions. [2019-09-08 09:32:43,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 66576 states and 94961 transitions. [2019-09-08 09:32:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:32:43,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:43,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:43,433 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1598358574, now seen corresponding path program 1 times [2019-09-08 09:32:43,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:43,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:43,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:43,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:43,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:43,615 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 09:32:43,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:43,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:43,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:43,617 INFO L87 Difference]: Start difference. First operand 66576 states and 94961 transitions. Second operand 4 states. [2019-09-08 09:32:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:48,834 INFO L93 Difference]: Finished difference Result 124210 states and 177091 transitions. [2019-09-08 09:32:48,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:32:48,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 09:32:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:48,906 INFO L225 Difference]: With dead ends: 124210 [2019-09-08 09:32:48,907 INFO L226 Difference]: Without dead ends: 57938 [2019-09-08 09:32:48,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57938 states. [2019-09-08 09:32:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57938 to 57700. [2019-09-08 09:32:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57700 states. [2019-09-08 09:32:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57700 states to 57700 states and 82171 transitions. [2019-09-08 09:32:54,129 INFO L78 Accepts]: Start accepts. Automaton has 57700 states and 82171 transitions. Word has length 176 [2019-09-08 09:32:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:54,129 INFO L475 AbstractCegarLoop]: Abstraction has 57700 states and 82171 transitions. [2019-09-08 09:32:54,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 57700 states and 82171 transitions. [2019-09-08 09:32:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:32:54,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:54,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:54,143 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:54,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1729659236, now seen corresponding path program 1 times [2019-09-08 09:32:54,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:54,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:54,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:54,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:54,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:54,249 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 09:32:54,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:54,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:54,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:54,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:54,252 INFO L87 Difference]: Start difference. First operand 57700 states and 82171 transitions. Second operand 3 states. [2019-09-08 09:33:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:01,697 INFO L93 Difference]: Finished difference Result 103676 states and 150358 transitions. [2019-09-08 09:33:01,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:33:01,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 09:33:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:01,773 INFO L225 Difference]: With dead ends: 103676 [2019-09-08 09:33:01,773 INFO L226 Difference]: Without dead ends: 67756 [2019-09-08 09:33:01,803 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 09:33:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67756 states. [2019-09-08 09:33:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67756 to 67754. [2019-09-08 09:33:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67754 states. [2019-09-08 09:33:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67754 states to 67754 states and 97023 transitions. [2019-09-08 09:33:07,860 INFO L78 Accepts]: Start accepts. Automaton has 67754 states and 97023 transitions. Word has length 178 [2019-09-08 09:33:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:07,860 INFO L475 AbstractCegarLoop]: Abstraction has 67754 states and 97023 transitions. [2019-09-08 09:33:07,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:33:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 67754 states and 97023 transitions. [2019-09-08 09:33:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:33:07,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:07,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:33:07,876 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:07,876 INFO L82 PathProgramCache]: Analyzing trace with hash 629623711, now seen corresponding path program 1 times [2019-09-08 09:33:07,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:07,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:07,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:07,957 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 09:33:07,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:33:07,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:33:07,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:33:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:33:07,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:33:07,959 INFO L87 Difference]: Start difference. First operand 67754 states and 97023 transitions. Second operand 3 states. [2019-09-08 09:33:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:22,221 INFO L93 Difference]: Finished difference Result 194068 states and 279045 transitions. [2019-09-08 09:33:22,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:33:22,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 09:33:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:22,396 INFO L225 Difference]: With dead ends: 194068 [2019-09-08 09:33:22,396 INFO L226 Difference]: Without dead ends: 132718 [2019-09-08 09:33:22,458 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 09:33:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132718 states. [2019-09-08 09:33:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132718 to 132716. [2019-09-08 09:33:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132716 states. [2019-09-08 09:33:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132716 states to 132716 states and 188347 transitions. [2019-09-08 09:33:35,084 INFO L78 Accepts]: Start accepts. Automaton has 132716 states and 188347 transitions. Word has length 178 [2019-09-08 09:33:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:35,084 INFO L475 AbstractCegarLoop]: Abstraction has 132716 states and 188347 transitions. [2019-09-08 09:33:35,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:33:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 132716 states and 188347 transitions. [2019-09-08 09:33:35,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:33:35,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:35,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:33:35,114 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:35,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash 877619674, now seen corresponding path program 1 times [2019-09-08 09:33:35,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:35,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:35,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:35,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:35,251 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 09:33:35,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:33:35,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:33:35,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:33:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:33:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:33:35,252 INFO L87 Difference]: Start difference. First operand 132716 states and 188347 transitions. Second operand 5 states. [2019-09-08 09:33:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:48,240 INFO L93 Difference]: Finished difference Result 203220 states and 290785 transitions. [2019-09-08 09:33:48,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:33:48,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-08 09:33:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:48,378 INFO L225 Difference]: With dead ends: 203220 [2019-09-08 09:33:48,378 INFO L226 Difference]: Without dead ends: 105652 [2019-09-08 09:33:48,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:33:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105652 states. [2019-09-08 09:33:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105652 to 105650. [2019-09-08 09:33:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105650 states. [2019-09-08 09:33:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105650 states to 105650 states and 150201 transitions. [2019-09-08 09:33:58,880 INFO L78 Accepts]: Start accepts. Automaton has 105650 states and 150201 transitions. Word has length 178 [2019-09-08 09:33:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:58,881 INFO L475 AbstractCegarLoop]: Abstraction has 105650 states and 150201 transitions. [2019-09-08 09:33:58,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:33:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 105650 states and 150201 transitions. [2019-09-08 09:33:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:33:58,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:58,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:33:58,906 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash -497687846, now seen corresponding path program 1 times [2019-09-08 09:33:58,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:58,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:58,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:59,103 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 09:33:59,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:33:59,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:33:59,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:33:59,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:33:59,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:33:59,105 INFO L87 Difference]: Start difference. First operand 105650 states and 150201 transitions. Second operand 8 states. [2019-09-08 09:34:36,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:34:36,852 INFO L93 Difference]: Finished difference Result 404490 states and 592846 transitions. [2019-09-08 09:34:36,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 09:34:36,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-08 09:34:36,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:34:37,490 INFO L225 Difference]: With dead ends: 404490 [2019-09-08 09:34:37,490 INFO L226 Difference]: Without dead ends: 324148 [2019-09-08 09:34:37,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:34:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324148 states. [2019-09-08 09:35:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324148 to 311777. [2019-09-08 09:35:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311777 states. [2019-09-08 09:35:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311777 states to 311777 states and 452725 transitions. [2019-09-08 09:35:20,445 INFO L78 Accepts]: Start accepts. Automaton has 311777 states and 452725 transitions. Word has length 178 [2019-09-08 09:35:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:20,445 INFO L475 AbstractCegarLoop]: Abstraction has 311777 states and 452725 transitions. [2019-09-08 09:35:20,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:35:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 311777 states and 452725 transitions. [2019-09-08 09:35:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:35:20,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:20,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:20,488 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash 398907811, now seen corresponding path program 1 times [2019-09-08 09:35:20,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:20,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:20,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:20,638 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 09:35:20,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:20,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:35:20,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:35:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:35:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:20,640 INFO L87 Difference]: Start difference. First operand 311777 states and 452725 transitions. Second operand 5 states. [2019-09-08 09:36:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:30,219 INFO L93 Difference]: Finished difference Result 811207 states and 1200237 transitions. [2019-09-08 09:36:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:36:30,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-08 09:36:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:31,239 INFO L225 Difference]: With dead ends: 811207 [2019-09-08 09:36:31,240 INFO L226 Difference]: Without dead ends: 550627 [2019-09-08 09:36:31,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:36:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550627 states. [2019-09-08 09:37:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550627 to 360788. [2019-09-08 09:37:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360788 states. [2019-09-08 09:37:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360788 states to 360788 states and 526337 transitions. [2019-09-08 09:37:23,084 INFO L78 Accepts]: Start accepts. Automaton has 360788 states and 526337 transitions. Word has length 178 [2019-09-08 09:37:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:37:23,084 INFO L475 AbstractCegarLoop]: Abstraction has 360788 states and 526337 transitions. [2019-09-08 09:37:23,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:37:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 360788 states and 526337 transitions. [2019-09-08 09:37:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:37:23,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:37:23,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:23,133 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:37:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:37:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1242603885, now seen corresponding path program 1 times [2019-09-08 09:37:23,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:37:23,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:37:23,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:23,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:37:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:37:24,907 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 09:37:24,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:37:24,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 09:37:24,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 09:37:24,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 09:37:24,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-09-08 09:37:24,909 INFO L87 Difference]: Start difference. First operand 360788 states and 526337 transitions. Second operand 25 states. [2019-09-08 09:38:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:21,330 INFO L93 Difference]: Finished difference Result 602215 states and 884985 transitions. [2019-09-08 09:38:21,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 09:38:21,331 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2019-09-08 09:38:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:22,048 INFO L225 Difference]: With dead ends: 602215 [2019-09-08 09:38:22,048 INFO L226 Difference]: Without dead ends: 409191 [2019-09-08 09:38:22,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:38:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409191 states. [2019-09-08 09:39:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409191 to 394153. [2019-09-08 09:39:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394153 states. [2019-09-08 09:39:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394153 states to 394153 states and 574458 transitions. [2019-09-08 09:39:15,397 INFO L78 Accepts]: Start accepts. Automaton has 394153 states and 574458 transitions. Word has length 178 [2019-09-08 09:39:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:15,398 INFO L475 AbstractCegarLoop]: Abstraction has 394153 states and 574458 transitions. [2019-09-08 09:39:15,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 09:39:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 394153 states and 574458 transitions. [2019-09-08 09:39:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:39:16,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:16,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:16,057 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash 464171816, now seen corresponding path program 1 times [2019-09-08 09:39:16,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:16,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:16,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:16,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:16,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:16,230 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 09:39:16,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:16,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:39:16,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:39:16,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:39:16,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:16,232 INFO L87 Difference]: Start difference. First operand 394153 states and 574458 transitions. Second operand 5 states. [2019-09-08 09:40:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:32,395 INFO L93 Difference]: Finished difference Result 698510 states and 1028880 transitions. [2019-09-08 09:40:32,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:40:32,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-08 09:40:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:33,475 INFO L225 Difference]: With dead ends: 698510 [2019-09-08 09:40:33,475 INFO L226 Difference]: Without dead ends: 601808 [2019-09-08 09:40:33,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601808 states. [2019-09-08 09:41:38,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601808 to 442144. [2019-09-08 09:41:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442144 states. [2019-09-08 09:41:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442144 states to 442144 states and 645510 transitions. [2019-09-08 09:41:39,491 INFO L78 Accepts]: Start accepts. Automaton has 442144 states and 645510 transitions. Word has length 178 [2019-09-08 09:41:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:39,492 INFO L475 AbstractCegarLoop]: Abstraction has 442144 states and 645510 transitions. [2019-09-08 09:41:39,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:41:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 442144 states and 645510 transitions. [2019-09-08 09:41:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:41:39,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:39,536 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1307867890, now seen corresponding path program 1 times [2019-09-08 09:41:39,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:39,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:39,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:39,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:39,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:39,866 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 09:41:39,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:39,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:41:39,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:41:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:41:39,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:41:39,868 INFO L87 Difference]: Start difference. First operand 442144 states and 645510 transitions. Second operand 16 states.