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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:08:50,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:08:50,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:08:50,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:08:50,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:08:50,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:08:50,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:08:50,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:08:50,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:08:50,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:08:50,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:08:50,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:08:50,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:08:50,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:08:50,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:08:50,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:08:50,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:08:50,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:08:50,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:08:50,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:08:50,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:08:50,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:08:50,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:08:50,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:08:50,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:08:50,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:08:50,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:08:50,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:08:50,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:08:50,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:08:50,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:08:50,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:08:50,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:08:50,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:08:50,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:08:50,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:08:50,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:08:50,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:08:50,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:08:50,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:08:50,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:08:50,593 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-20 13:08:50,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:08:50,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:08:50,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:08:50,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:08:50,621 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:08:50,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:08:50,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:08:50,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:08:50,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:08:50,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:08:50,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:08:50,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:08:50,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:08:50,625 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:08:50,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:08:50,625 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:08:50,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:08:50,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:08:50,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:08:50,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:08:50,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:08:50,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:08:50,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:08:50,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:08:50,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:08:50,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:08:50,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:08:50,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:08:50,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:08:50,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:08:50,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:08:50,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:08:50,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:08:50,708 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:08:50,708 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-20 13:08:50,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6103727ba/f30c06fec62c4cf39ddfce717a08ec95/FLAGca9496635 [2019-09-20 13:08:51,338 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:08:51,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-20 13:08:51,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6103727ba/f30c06fec62c4cf39ddfce717a08ec95/FLAGca9496635 [2019-09-20 13:08:51,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6103727ba/f30c06fec62c4cf39ddfce717a08ec95 [2019-09-20 13:08:51,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:08:51,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:08:51,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:51,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:08:51,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:08:51,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:51,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d112aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51, skipping insertion in model container [2019-09-20 13:08:51,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:51,781 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:08:51,864 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:08:52,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:52,370 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:08:52,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:52,553 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:08:52,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52 WrapperNode [2019-09-20 13:08:52,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:52,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:08:52,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:08:52,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:08:52,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52" (1/1) ... [2019-09-20 13:08:52,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52" (1/1) ... [2019-09-20 13:08:52,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52" (1/1) ... [2019-09-20 13:08:52,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52" (1/1) ... [2019-09-20 13:08:52,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52" (1/1) ... [2019-09-20 13:08:52,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52" (1/1) ... [2019-09-20 13:08:52,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52" (1/1) ... [2019-09-20 13:08:52,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:08:52,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:08:52,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:08:52,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:08:52,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52" (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-20 13:08:52,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:08:52,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:08:52,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:08:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:08:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:08:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-20 13:08:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-20 13:08:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:08:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-20 13:08:52,733 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-20 13:08:52,733 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-20 13:08:52,733 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-20 13:08:52,733 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-20 13:08:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-20 13:08:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-20 13:08:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:08:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:08:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:08:54,129 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:08:54,130 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:08:54,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:54 BoogieIcfgContainer [2019-09-20 13:08:54,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:08:54,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:08:54,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:08:54,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:08:54,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:08:51" (1/3) ... [2019-09-20 13:08:54,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a2bdc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:54, skipping insertion in model container [2019-09-20 13:08:54,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:52" (2/3) ... [2019-09-20 13:08:54,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a2bdc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:54, skipping insertion in model container [2019-09-20 13:08:54,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:54" (3/3) ... [2019-09-20 13:08:54,141 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-20 13:08:54,151 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:08:54,160 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:08:54,179 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:08:54,214 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:08:54,215 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:08:54,215 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:08:54,215 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:08:54,215 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:08:54,215 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:08:54,215 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:08:54,216 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:08:54,216 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:08:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2019-09-20 13:08:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:08:54,253 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:54,254 INFO L407 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] [2019-09-20 13:08:54,256 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:54,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash -766456376, now seen corresponding path program 1 times [2019-09-20 13:08:54,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:54,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:54,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,829 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-20 13:08:54,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:54,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:54,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:54,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:54,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:54,855 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 3 states. [2019-09-20 13:08:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,017 INFO L93 Difference]: Finished difference Result 489 states and 838 transitions. [2019-09-20 13:08:55,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:55,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:08:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,036 INFO L225 Difference]: With dead ends: 489 [2019-09-20 13:08:55,036 INFO L226 Difference]: Without dead ends: 362 [2019-09-20 13:08:55,041 INFO L636 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-20 13:08:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-20 13:08:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-09-20 13:08:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:08:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-09-20 13:08:55,129 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 104 [2019-09-20 13:08:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,130 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-09-20 13:08:55,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-09-20 13:08:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:08:55,133 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,133 INFO L407 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] [2019-09-20 13:08:55,134 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1314271708, now seen corresponding path program 1 times [2019-09-20 13:08:55,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,529 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-20 13:08:55,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:55,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:55,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:55,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:55,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:55,533 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2019-09-20 13:08:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,674 INFO L93 Difference]: Finished difference Result 1038 states and 1576 transitions. [2019-09-20 13:08:55,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:55,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:08:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,681 INFO L225 Difference]: With dead ends: 1038 [2019-09-20 13:08:55,681 INFO L226 Difference]: Without dead ends: 691 [2019-09-20 13:08:55,685 INFO L636 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-20 13:08:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-09-20 13:08:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2019-09-20 13:08:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-09-20 13:08:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1038 transitions. [2019-09-20 13:08:55,755 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1038 transitions. Word has length 104 [2019-09-20 13:08:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,757 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 1038 transitions. [2019-09-20 13:08:55,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1038 transitions. [2019-09-20 13:08:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:55,767 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,767 INFO L407 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] [2019-09-20 13:08:55,767 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2074994812, now seen corresponding path program 1 times [2019-09-20 13:08:55,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,874 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-20 13:08:55,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:55,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:55,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:55,877 INFO L87 Difference]: Start difference. First operand 689 states and 1038 transitions. Second operand 3 states. [2019-09-20 13:08:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,950 INFO L93 Difference]: Finished difference Result 2021 states and 3044 transitions. [2019-09-20 13:08:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:55,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-20 13:08:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,963 INFO L225 Difference]: With dead ends: 2021 [2019-09-20 13:08:55,964 INFO L226 Difference]: Without dead ends: 1364 [2019-09-20 13:08:55,967 INFO L636 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-20 13:08:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-09-20 13:08:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 691. [2019-09-20 13:08:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-20 13:08:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1040 transitions. [2019-09-20 13:08:56,030 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1040 transitions. Word has length 105 [2019-09-20 13:08:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:56,030 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1040 transitions. [2019-09-20 13:08:56,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1040 transitions. [2019-09-20 13:08:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:08:56,032 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:56,033 INFO L407 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] [2019-09-20 13:08:56,033 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1322406660, now seen corresponding path program 1 times [2019-09-20 13:08:56,034 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:56,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:56,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:56,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:56,195 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-20 13:08:56,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:56,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:56,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:56,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:56,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:56,198 INFO L87 Difference]: Start difference. First operand 691 states and 1040 transitions. Second operand 3 states. [2019-09-20 13:08:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:56,298 INFO L93 Difference]: Finished difference Result 1822 states and 2765 transitions. [2019-09-20 13:08:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:56,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-20 13:08:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:56,306 INFO L225 Difference]: With dead ends: 1822 [2019-09-20 13:08:56,306 INFO L226 Difference]: Without dead ends: 1330 [2019-09-20 13:08:56,308 INFO L636 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-20 13:08:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-09-20 13:08:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2019-09-20 13:08:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-09-20 13:08:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1983 transitions. [2019-09-20 13:08:56,394 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1983 transitions. Word has length 106 [2019-09-20 13:08:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:56,394 INFO L475 AbstractCegarLoop]: Abstraction has 1328 states and 1983 transitions. [2019-09-20 13:08:56,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1983 transitions. [2019-09-20 13:08:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:08:56,398 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:56,398 INFO L407 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] [2019-09-20 13:08:56,398 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1537198239, now seen corresponding path program 1 times [2019-09-20 13:08:56,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:56,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:56,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:56,588 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-20 13:08:56,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:56,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:56,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:56,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:56,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:56,590 INFO L87 Difference]: Start difference. First operand 1328 states and 1983 transitions. Second operand 4 states. [2019-09-20 13:08:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:56,682 INFO L93 Difference]: Finished difference Result 2157 states and 3243 transitions. [2019-09-20 13:08:56,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:56,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:08:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:56,692 INFO L225 Difference]: With dead ends: 2157 [2019-09-20 13:08:56,692 INFO L226 Difference]: Without dead ends: 1016 [2019-09-20 13:08:56,696 INFO L636 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-20 13:08:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-09-20 13:08:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2019-09-20 13:08:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-09-20 13:08:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1511 transitions. [2019-09-20 13:08:56,772 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1511 transitions. Word has length 106 [2019-09-20 13:08:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:56,773 INFO L475 AbstractCegarLoop]: Abstraction has 1016 states and 1511 transitions. [2019-09-20 13:08:56,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1511 transitions. [2019-09-20 13:08:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:08:56,776 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:56,777 INFO L407 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] [2019-09-20 13:08:56,777 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1464646849, now seen corresponding path program 1 times [2019-09-20 13:08:56,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:56,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:56,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:56,888 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-20 13:08:56,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:56,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:56,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:56,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:56,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:56,891 INFO L87 Difference]: Start difference. First operand 1016 states and 1511 transitions. Second operand 3 states. [2019-09-20 13:08:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:57,034 INFO L93 Difference]: Finished difference Result 2291 states and 3531 transitions. [2019-09-20 13:08:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:57,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-20 13:08:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:57,046 INFO L225 Difference]: With dead ends: 2291 [2019-09-20 13:08:57,047 INFO L226 Difference]: Without dead ends: 1464 [2019-09-20 13:08:57,049 INFO L636 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-20 13:08:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-09-20 13:08:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1432. [2019-09-20 13:08:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-09-20 13:08:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2190 transitions. [2019-09-20 13:08:57,183 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2190 transitions. Word has length 106 [2019-09-20 13:08:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:57,184 INFO L475 AbstractCegarLoop]: Abstraction has 1432 states and 2190 transitions. [2019-09-20 13:08:57,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2190 transitions. [2019-09-20 13:08:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:08:57,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:57,189 INFO L407 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] [2019-09-20 13:08:57,189 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:57,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1043553758, now seen corresponding path program 1 times [2019-09-20 13:08:57,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:57,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:57,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:57,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:57,326 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-20 13:08:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:57,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:57,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:57,328 INFO L87 Difference]: Start difference. First operand 1432 states and 2190 transitions. Second operand 3 states. [2019-09-20 13:08:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:57,513 INFO L93 Difference]: Finished difference Result 3397 states and 5357 transitions. [2019-09-20 13:08:57,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:57,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-20 13:08:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:57,526 INFO L225 Difference]: With dead ends: 3397 [2019-09-20 13:08:57,527 INFO L226 Difference]: Without dead ends: 2238 [2019-09-20 13:08:57,530 INFO L636 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-20 13:08:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-09-20 13:08:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2176. [2019-09-20 13:08:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-09-20 13:08:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3396 transitions. [2019-09-20 13:08:57,673 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3396 transitions. Word has length 108 [2019-09-20 13:08:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:57,673 INFO L475 AbstractCegarLoop]: Abstraction has 2176 states and 3396 transitions. [2019-09-20 13:08:57,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3396 transitions. [2019-09-20 13:08:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:08:57,676 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:57,676 INFO L407 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] [2019-09-20 13:08:57,676 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1020043605, now seen corresponding path program 1 times [2019-09-20 13:08:57,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:57,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:57,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:57,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:57,808 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-20 13:08:57,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:57,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:57,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:57,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:57,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:57,809 INFO L87 Difference]: Start difference. First operand 2176 states and 3396 transitions. Second operand 5 states. [2019-09-20 13:08:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:58,204 INFO L93 Difference]: Finished difference Result 4171 states and 6562 transitions. [2019-09-20 13:08:58,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:58,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-20 13:08:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:58,216 INFO L225 Difference]: With dead ends: 4171 [2019-09-20 13:08:58,216 INFO L226 Difference]: Without dead ends: 2178 [2019-09-20 13:08:58,221 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-09-20 13:08:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2176. [2019-09-20 13:08:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-09-20 13:08:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3381 transitions. [2019-09-20 13:08:58,414 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3381 transitions. Word has length 109 [2019-09-20 13:08:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:58,414 INFO L475 AbstractCegarLoop]: Abstraction has 2176 states and 3381 transitions. [2019-09-20 13:08:58,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3381 transitions. [2019-09-20 13:08:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:08:58,418 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:58,418 INFO L407 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] [2019-09-20 13:08:58,418 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:58,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:58,419 INFO L82 PathProgramCache]: Analyzing trace with hash 802679046, now seen corresponding path program 1 times [2019-09-20 13:08:58,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:58,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:58,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:58,698 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-20 13:08:58,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:58,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:58,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:58,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:58,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:58,699 INFO L87 Difference]: Start difference. First operand 2176 states and 3381 transitions. Second operand 4 states. [2019-09-20 13:08:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:58,971 INFO L93 Difference]: Finished difference Result 5611 states and 8738 transitions. [2019-09-20 13:08:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:58,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-20 13:08:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:58,992 INFO L225 Difference]: With dead ends: 5611 [2019-09-20 13:08:58,992 INFO L226 Difference]: Without dead ends: 3458 [2019-09-20 13:08:58,998 INFO L636 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-20 13:08:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-09-20 13:08:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3456. [2019-09-20 13:08:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2019-09-20 13:08:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 5341 transitions. [2019-09-20 13:08:59,235 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 5341 transitions. Word has length 109 [2019-09-20 13:08:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:59,236 INFO L475 AbstractCegarLoop]: Abstraction has 3456 states and 5341 transitions. [2019-09-20 13:08:59,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 5341 transitions. [2019-09-20 13:08:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:08:59,238 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:59,238 INFO L407 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] [2019-09-20 13:08:59,239 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:59,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2079942452, now seen corresponding path program 1 times [2019-09-20 13:08:59,239 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:59,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:59,336 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-20 13:08:59,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:59,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:59,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:59,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:59,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:59,338 INFO L87 Difference]: Start difference. First operand 3456 states and 5341 transitions. Second operand 3 states. [2019-09-20 13:08:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:59,771 INFO L93 Difference]: Finished difference Result 9594 states and 14954 transitions. [2019-09-20 13:08:59,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:59,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-20 13:08:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:59,806 INFO L225 Difference]: With dead ends: 9594 [2019-09-20 13:08:59,806 INFO L226 Difference]: Without dead ends: 6514 [2019-09-20 13:08:59,814 INFO L636 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-20 13:08:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-09-20 13:09:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6512. [2019-09-20 13:09:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-09-20 13:09:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10016 transitions. [2019-09-20 13:09:00,317 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10016 transitions. Word has length 111 [2019-09-20 13:09:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:00,318 INFO L475 AbstractCegarLoop]: Abstraction has 6512 states and 10016 transitions. [2019-09-20 13:09:00,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10016 transitions. [2019-09-20 13:09:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:09:00,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:00,322 INFO L407 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] [2019-09-20 13:09:00,322 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:00,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:00,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2028254793, now seen corresponding path program 1 times [2019-09-20 13:09:00,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:00,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:00,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:00,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:00,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:00,503 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-20 13:09:00,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:00,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:09:00,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:09:00,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:09:00,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:09:00,505 INFO L87 Difference]: Start difference. First operand 6512 states and 10016 transitions. Second operand 4 states. [2019-09-20 13:09:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:00,895 INFO L93 Difference]: Finished difference Result 10292 states and 15865 transitions. [2019-09-20 13:09:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:09:00,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-20 13:09:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:00,921 INFO L225 Difference]: With dead ends: 10292 [2019-09-20 13:09:00,921 INFO L226 Difference]: Without dead ends: 5311 [2019-09-20 13:09:00,931 INFO L636 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-20 13:09:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-09-20 13:09:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5311. [2019-09-20 13:09:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-09-20 13:09:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 8136 transitions. [2019-09-20 13:09:01,259 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 8136 transitions. Word has length 111 [2019-09-20 13:09:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:01,259 INFO L475 AbstractCegarLoop]: Abstraction has 5311 states and 8136 transitions. [2019-09-20 13:09:01,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:09:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 8136 transitions. [2019-09-20 13:09:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:09:01,263 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:01,263 INFO L407 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] [2019-09-20 13:09:01,263 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:01,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1274580373, now seen corresponding path program 1 times [2019-09-20 13:09:01,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:01,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:01,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:01,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:01,341 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-20 13:09:01,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:01,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:01,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:01,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:01,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:01,343 INFO L87 Difference]: Start difference. First operand 5311 states and 8136 transitions. Second operand 3 states. [2019-09-20 13:09:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:01,893 INFO L93 Difference]: Finished difference Result 13935 states and 21751 transitions. [2019-09-20 13:09:01,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:01,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-20 13:09:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:01,921 INFO L225 Difference]: With dead ends: 13935 [2019-09-20 13:09:01,921 INFO L226 Difference]: Without dead ends: 8965 [2019-09-20 13:09:01,932 INFO L636 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-20 13:09:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-09-20 13:09:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8683. [2019-09-20 13:09:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2019-09-20 13:09:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 13503 transitions. [2019-09-20 13:09:02,407 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 13503 transitions. Word has length 113 [2019-09-20 13:09:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:02,408 INFO L475 AbstractCegarLoop]: Abstraction has 8683 states and 13503 transitions. [2019-09-20 13:09:02,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 13503 transitions. [2019-09-20 13:09:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:09:02,411 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:02,411 INFO L407 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] [2019-09-20 13:09:02,412 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash 723633182, now seen corresponding path program 1 times [2019-09-20 13:09:02,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:02,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:02,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:02,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:02,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:02,573 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-20 13:09:02,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:02,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:09:02,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:09:02,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:09:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:09:02,575 INFO L87 Difference]: Start difference. First operand 8683 states and 13503 transitions. Second operand 4 states. [2019-09-20 13:09:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:03,687 INFO L93 Difference]: Finished difference Result 24205 states and 37580 transitions. [2019-09-20 13:09:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:09:03,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:09:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:03,723 INFO L225 Difference]: With dead ends: 24205 [2019-09-20 13:09:03,723 INFO L226 Difference]: Without dead ends: 15565 [2019-09-20 13:09:03,742 INFO L636 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-20 13:09:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2019-09-20 13:09:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15563. [2019-09-20 13:09:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-09-20 13:09:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23928 transitions. [2019-09-20 13:09:04,836 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23928 transitions. Word has length 114 [2019-09-20 13:09:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:04,836 INFO L475 AbstractCegarLoop]: Abstraction has 15563 states and 23928 transitions. [2019-09-20 13:09:04,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:09:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23928 transitions. [2019-09-20 13:09:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:09:04,842 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:04,842 INFO L407 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] [2019-09-20 13:09:04,843 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:04,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1996953920, now seen corresponding path program 1 times [2019-09-20 13:09:04,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:04,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:04,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:04,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:04,895 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-20 13:09:04,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:04,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:04,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:04,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:04,896 INFO L87 Difference]: Start difference. First operand 15563 states and 23928 transitions. Second operand 3 states. [2019-09-20 13:09:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:06,748 INFO L93 Difference]: Finished difference Result 46487 states and 71527 transitions. [2019-09-20 13:09:06,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:06,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-20 13:09:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:06,836 INFO L225 Difference]: With dead ends: 46487 [2019-09-20 13:09:06,836 INFO L226 Difference]: Without dead ends: 31034 [2019-09-20 13:09:06,868 INFO L636 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-20 13:09:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31034 states. [2019-09-20 13:09:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31034 to 15569. [2019-09-20 13:09:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15569 states. [2019-09-20 13:09:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15569 states to 15569 states and 23934 transitions. [2019-09-20 13:09:07,813 INFO L78 Accepts]: Start accepts. Automaton has 15569 states and 23934 transitions. Word has length 115 [2019-09-20 13:09:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:07,813 INFO L475 AbstractCegarLoop]: Abstraction has 15569 states and 23934 transitions. [2019-09-20 13:09:07,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 15569 states and 23934 transitions. [2019-09-20 13:09:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:09:07,820 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:07,820 INFO L407 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] [2019-09-20 13:09:07,820 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1312027809, now seen corresponding path program 1 times [2019-09-20 13:09:07,821 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:07,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:07,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:07,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:07,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:09:07,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:07,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:09:07,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:09:07,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:09:07,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:09:07,939 INFO L87 Difference]: Start difference. First operand 15569 states and 23934 transitions. Second operand 4 states. [2019-09-20 13:09:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:09,029 INFO L93 Difference]: Finished difference Result 31096 states and 47812 transitions. [2019-09-20 13:09:09,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:09:09,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-20 13:09:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:09,065 INFO L225 Difference]: With dead ends: 31096 [2019-09-20 13:09:09,066 INFO L226 Difference]: Without dead ends: 15563 [2019-09-20 13:09:09,093 INFO L636 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-20 13:09:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2019-09-20 13:09:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15563. [2019-09-20 13:09:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-09-20 13:09:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23922 transitions. [2019-09-20 13:09:09,909 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23922 transitions. Word has length 116 [2019-09-20 13:09:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:09,910 INFO L475 AbstractCegarLoop]: Abstraction has 15563 states and 23922 transitions. [2019-09-20 13:09:09,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:09:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23922 transitions. [2019-09-20 13:09:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:09:09,916 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:09,916 INFO L407 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] [2019-09-20 13:09:09,916 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1204434274, now seen corresponding path program 1 times [2019-09-20 13:09:09,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:09,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:09,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:10,013 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-20 13:09:10,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:10,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:10,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:10,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:10,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:10,017 INFO L87 Difference]: Start difference. First operand 15563 states and 23922 transitions. Second operand 3 states. [2019-09-20 13:09:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:11,048 INFO L93 Difference]: Finished difference Result 37297 states and 57457 transitions. [2019-09-20 13:09:11,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:11,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-20 13:09:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:11,103 INFO L225 Difference]: With dead ends: 37297 [2019-09-20 13:09:11,103 INFO L226 Difference]: Without dead ends: 22487 [2019-09-20 13:09:11,124 INFO L636 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-20 13:09:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22487 states. [2019-09-20 13:09:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22487 to 22485. [2019-09-20 13:09:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22485 states. [2019-09-20 13:09:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22485 states to 22485 states and 34047 transitions. [2019-09-20 13:09:12,937 INFO L78 Accepts]: Start accepts. Automaton has 22485 states and 34047 transitions. Word has length 116 [2019-09-20 13:09:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:12,938 INFO L475 AbstractCegarLoop]: Abstraction has 22485 states and 34047 transitions. [2019-09-20 13:09:12,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 22485 states and 34047 transitions. [2019-09-20 13:09:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:09:12,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:12,945 INFO L407 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] [2019-09-20 13:09:12,945 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:12,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash 306834164, now seen corresponding path program 1 times [2019-09-20 13:09:12,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:12,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:12,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:12,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:12,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:13,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-20 13:09:13,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:13,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:13,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:13,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:13,029 INFO L87 Difference]: Start difference. First operand 22485 states and 34047 transitions. Second operand 3 states. [2019-09-20 13:09:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:14,959 INFO L93 Difference]: Finished difference Result 61641 states and 95217 transitions. [2019-09-20 13:09:14,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:14,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-20 13:09:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:15,024 INFO L225 Difference]: With dead ends: 61641 [2019-09-20 13:09:15,025 INFO L226 Difference]: Without dead ends: 42063 [2019-09-20 13:09:15,045 INFO L636 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-20 13:09:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42063 states. [2019-09-20 13:09:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42063 to 41977. [2019-09-20 13:09:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41977 states. [2019-09-20 13:09:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41977 states to 41977 states and 63515 transitions. [2019-09-20 13:09:17,082 INFO L78 Accepts]: Start accepts. Automaton has 41977 states and 63515 transitions. Word has length 119 [2019-09-20 13:09:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:17,083 INFO L475 AbstractCegarLoop]: Abstraction has 41977 states and 63515 transitions. [2019-09-20 13:09:17,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 41977 states and 63515 transitions. [2019-09-20 13:09:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:09:17,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:17,089 INFO L407 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] [2019-09-20 13:09:17,089 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2137277520, now seen corresponding path program 1 times [2019-09-20 13:09:17,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:17,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:17,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:17,359 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-20 13:09:17,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:17,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:09:17,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:09:17,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:09:17,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:09:17,361 INFO L87 Difference]: Start difference. First operand 41977 states and 63515 transitions. Second operand 12 states. [2019-09-20 13:09:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:24,905 INFO L93 Difference]: Finished difference Result 157307 states and 240454 transitions. [2019-09-20 13:09:24,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:09:24,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2019-09-20 13:09:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:25,095 INFO L225 Difference]: With dead ends: 157307 [2019-09-20 13:09:25,096 INFO L226 Difference]: Without dead ends: 117623 [2019-09-20 13:09:25,143 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:09:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117623 states.